We discuss algorithmic matters of a computer code for solving linear two-point boundary-value problems. The method of solution uses superposition coupled with an orthonormalization procedure and a ...

Let Ω ⊂ ℝp, p ϵ ℕ* be a nonempty subset and B(Ω) be the Branch lattice of all bounded real functions on a Ω, equipped with sup norm. Let 𝑋 ⊂ 𝐵(Ω) be a linear sublattice of 𝐵(Ω) and 𝐴: 𝑋 → 𝑋 be a ...