SIAM Journal on Numerical Analysis, Vol. 25, No. 6 (Dec., 1988), pp. 1213-1236 (24 pages) A domain decomposition method for second-order elliptic problems is considered. An iterative procedure that ...

This paper is concerned with numerical methods for a class of two-dimensional quasilinear elliptic boundary value problems. A compact finite difference method with a nonisotropic mesh is proposed for ...

Therefore, a line-search algorithm is an iterative process that optimizes a nonlinear function of one parameter () within each iteration k of the optimization technique, which itself tries to optimize ...

The circumference of a sphere is measured to be 24 cm, with a possible error of 0.25 cm. Use the differential \(dV\) to estimate the maximum error in the calculated ...

Banach spaces, as complete normed vector spaces, form a central framework in modern functional analysis. Their rich geometric structure underpins much of the theoretical development in approximation ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...