- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
Least-squares(LS) finite element methods are applied successfully to a wide range of problems arising from science and engineering. However, there are reservations to use LS methods for problems with low regularity solutions. In this paper, we consider LS methods for second-order elliptic problems using the minimum regularity assumption, i.e. the solution only belongs to $H^1$ space. We provide a theoretical analysis showing that LS methods are competitive alternatives to mixed and standard Galerkin methods by establishing that LS solutions are bounded by the mixed and standard Galerkin solutions.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/602.html} }Least-squares(LS) finite element methods are applied successfully to a wide range of problems arising from science and engineering. However, there are reservations to use LS methods for problems with low regularity solutions. In this paper, we consider LS methods for second-order elliptic problems using the minimum regularity assumption, i.e. the solution only belongs to $H^1$ space. We provide a theoretical analysis showing that LS methods are competitive alternatives to mixed and standard Galerkin methods by establishing that LS solutions are bounded by the mixed and standard Galerkin solutions.