Angenäherte Auflösung von Systemen linearer Gleichungen.
From MaRDI portal
Publication:2601176
Zur Lösung des linearen Gleichungssystems \[ \sum_{k=1}^n a_{ik}x_k+b_i=0 \qquad (i =1,2,\ldots, n), \] das der Bedingung \[ \sum_{k=1}^n a_{ik}^2=1 \] wenigstens annähernd genügt, geht man von beliebigen ersten Näherungen \(x_1^0, x_2^0,\ldots,x_n^0\) aus und teilt die folgenden Näherungen in Gruppen zu \(n\). Ist die \(p\)-te Gruppe \[ \begin{matrix}\l\\ x_1^{(p,1)}\;x_2^{(p,1)} \;\ldots \;x_n^{(p,1)}\\ \hdotsfor1\\ x_1^{(p,n)}\;x_2^{(p,n)} \;\ldots \;x_n^{(p,n)}, \end{matrix} \] so bildet man daraus eine \((p+1)\)-te Gruppe nach folgendem Schema \[ \begin{matrix}\l\\ x_i^{(p+1,1)} = x_i^{(p,n)}\hphantom{^{+1-1}}-a_{1i}L_1^{(p,n)}\\ x_i^{(p+1,2)} = x_i^{(p+1,1)}\hphantom{^{-1}}-a_{2i}L_2^{(p+1,1)}\\ \hdotsfor1\\ x_i^{(p+1,n)} = x_i^{(p+1,n-1)}-a_{ni}L_n^{(p+1,n-1)}.\\ \end{matrix} \qquad (i=1,2,\ldots,n) \] Hier bedeutet \[ L_i^{(r,s)}=\sum_{k=1}^n a_{ik}x_k^{(r,s)}+b_i. \] Verf. zeigt, daß die Folge der Näherungen gegen die gesuchte Lösung konvergiert.
Cited in
(68)- On randomized sampling Kaczmarz method with application in compressed sensing
- A randomized block extended Kaczmarz method with hybrid partitions for solving large inconsistent linear systems
- Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- On constrained Kaczmarz algorithm with momentum for image reconstruction
- Greedy randomized sampling nonlinear Kaczmarz methods
- Maximal residual extended Kaczmarz and Gauss-Seidel methods-convergence properties and applications
- On adaptive stochastic heavy ball momentum for solving linear systems
- A finitely convergent circumcenter method for the convex feasibility problem
- Three-operator splitting for learning to predict equilibria in convex games
- On greedy randomized Kaczmarz-type methods for solving the system of tensor equations
- Bregman methods for large-scale optimization with applications in imaging
- Stochastic Steffensen method
- The multi-step randomized Kaczmarz algorithms for solving large consistent linear equations
- A Kaczmarz-inspired approach to accelerate the optimization of neural network wavefunctions
- Reflective block Kaczmarz algorithms for least squares
- On the adaptive deterministic block Kaczmarz method with momentum for solving large-scale consistent linear systems
- On weighted average fast block Kaczmarz methods for solving large consistent linear systems
- Greedy randomized Kaczmarz with momentum method for nonlinear equation
- Fourier series for singular measures in higher dimensions
- Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
- On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
- Modular data assimilation for flow prediction
- An improved deterministic block Kaczmarz method for solving linear matrix equation AXB = C
- A unified convergence analysis of random sketch methods for rank deficient linear systems
- On convergence of greedy block nonlinear Kaczmarz methods with momentum
- Nesterov's accelerated Jacobi-type methods for large-scale symmetric positive semidefinite linear systems
- On linear convergence of Landweber-type methods
- Construction of the Kolmogorov-Arnold networks using the Newton-Kaczmarz method
- Randomized extended average block Kaczmarz method for inconsistent tensor equations under t-product
- On the randomized multiple row-action methods for solving linear least-squares problems
- On the fast convergence of minibatch heavy ball momentum
- Constrained randomized Gauss-Seidel methods for nonnegative least-squares problem
- An accelerated surrogate hyperplane Kaczmarz method based on two-dimensional search
- Power of _1-norm regularized Kaczmarz algorithms for high-order tensor recovery
- Accelerating randomized surrounding method with momentum for consistent linear systems
- On multi-step partially randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
- Randomized Kaczmarz methods for t-product tensor linear systems with factorized operators
- Linear convergence of reshuffling Kaczmarz methods with sparse constraints
- Kaczmarz Kac walk
- Randomized iterative methods for generalized absolute value equations: solvability and error bounds
- On multi-step greedy Kaczmarz method for solving large sparse consistent linear systems
- K-means clustering based maximal residual (block) Kaczmarz methods for solving large scale system of linear equations
- A surrogate hyperplane Kaczmarz method with oblique projection for solving linear systems
- Randomized block residual steepest descent method with k-means clustering for large sparse linear systems
- On extended randomized Kaczmarz algorithm for solving Tikhonov regularization problem
- On the block Kaczmarz-Tanabe methods with relaxation parameters for solving linear systems
- Orthogonal block Kaczmarz inner-iteration preconditioned flexible GMRES method for large-scale linear systems
- Noise propagation in linear stationary iterations
- Inertial randomized Kaczmarz algorithms for solving coherent linear systems
- Greedy Kaczmarz methods for nonlinear equation
- On randomized multiple row-action methods for linear feasibility problems
- Quantile-based random sparse Kaczmarz for corrupted and noisy linear systems
- Convergence analysis of the nonlinear Kaczmarz method for systems of nonlinear equations with componentwise convex mappings and applications to image reconstruction in multispectral CT
- Linear discriminant analysis with the randomized Kaczmarz method
- On averaged block nonlinear Kaczmarz method with adaptive step size for solving systems of nonlinear equations
- A federated Kaczmarz algorithm
- On the subsample size of quantile-based randomized Kaczmarz
- On convergence of residual-based extended Kaczmarz method for solving inconsistent linear systems
- A residual-based randomized Kaczmarz method for solving linear feasibility problems
- On global convergence of steepest coordinate descent method
- Log-sum regularized Kaczmarz algorithms for high-order tensor recovery
- Generalized Gearhart-Koshy acceleration is a Krylov subspace method
- Beyond gradient descent: Yakubovich's stripe algorithms for finite-update learning
- A multi-step sketch-and-project solver for large sparse inconsistent linear systems: applications in signal and image processing
- Cosine distance-driven greedy block Gaussian-Kaczmarz algorithm and its variants for solving large-scale sparse overdetermined linear systems
- Relaxed greedy randomized Kaczmarz with signal averaging for solving doubly-noisy linear systems
- On trimming tensor-structured measurements and efficient low-rank tensor recovery
This page was built for publication: Angenäherte Auflösung von Systemen linearer Gleichungen.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2601176)
