Two composition methods for solving certain systems of linear equations
From MaRDI portal
The problem of solving the system of equations \(Ax=b\) is discussed, knowing that certain of its subsystems \(A^ 1x^ 1=b^ 1,...,A^ mx^ m=b^ m\) can be solved uniquely. Since these methods do not allow pivoting they usually may be less stable than classical methods. However, they are of particular interest for establishing computational methods for computing certain linear or quasilinear sequence transformations recursively. Two methods are presented and examples are given.
Recommendations
Cites work
- A general extrapolation algorithm
- A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
- A general recurrence interpolation formula and its applications to multivariate interpolation
- A method of matrix inverse triangular decomposition based on contiguous principal submatrices
- A Set of Principles to Interconnect the Solutions of Physical Systems
- Generalized neville type extrapolation schemes
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- The general Neville-Aitken-algorithm and some applications
- The mühlbach-neville-aitken algorithm and some extensions
Cited in
(8)- Convergence acceleration methods: The past decade
- A generalization of Sylvester's identity on determinants and some applications
- Generalized Schur-complements and a test for total positivity
- Elimination techniques and interpolation
- Elimination techniques: From extrapolation to totally positive matrices and CAGD
- A new approach to solve linear systems
- Two-point methods for solving equations and systems of equations
- scientific article; zbMATH DE number 3932309 (Why is no real title available?)
This page was built for publication: Two composition methods for solving certain systems of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060532)