The least squares solution of inconsistent discretized elliptic problems using the FETI method.
From MaRDI portal
Cites work
- A hybrid approach to 3‐level FETI
- A method of finite element tearing and interconnecting and its parallel solution algorithm
- Algorithm 937: MINRES-QLP for symmetric and Hermitian linear equations and least-squares problems
- An Unconventional Domain Decomposition Method for an Efficient Parallel Solution of Large-Scale Finite Element Systems
- Block-splitting preconditioners for indefinite least squares problem
- Bounds on the spectra of Schur complements of large H‐TFETI‐DP clusters for 2D Laplacian
- Cholesky decomposition of a positive semidefinite matrix with known kernel
- Conjugate gradients for symmetric positive semidefinite least-squares problems
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On Positive Semidefinite Matrices with Known Null Space
- Scalable hybrid TFETI-DP methods for large boundary variational inequalities
- Total FETI-an easier implementable variant of the FETI method for numerical solution of elliptic PDE
This page was built for publication: The least squares solution of inconsistent discretized elliptic problems using the FETI method.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855447)
