Abstract
AbstractContinuous (integral) and discrete (point‐matching) least‐squares methods are presented for linear and non‐linear problems in boundary‐value, eigenvalue, and initial‐value form. The history is traced, and important theoretical and practical results are summarized. A comprehensive sample of the literature is presented, indexed to show type of application, version of least squares used, and results of comparison studies. The advantages of least‐squares methods are discussed, including convenience in formulation and error evaluation, generality of mixed and local (finite element) versions, and performance that is competitive with other methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal for Numerical Methods in Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
