Pages that link to "Item:Q720610"
From MaRDI portal
The following pages link to Chebyshev-type methods and preconditioning techniques (Q720610):
Displaying 32 items.
- Finding generalized inverses by a fast and efficient numerical method (Q482683) (← links)
- A rapid numerical algorithm to compute matrix inversion (Q715101) (← links)
- A new iterative method for finding approximate inverses of complex matrices (Q1724392) (← links)
- Solving fourth order differential equations using particular solutions of Helmholtz-type equations (Q1726456) (← links)
- An improved computationally efficient method for finding the Drazin inverse (Q1727190) (← links)
- An efficient computation of generalized inverse of a matrix (Q1740439) (← links)
- An efficient method to compute the Moore-Penrose inverse (Q1747875) (← links)
- Factorizations of hyperpower family of iterative methods via least squares approach (Q1993608) (← links)
- The MAPS based on trigonometric basis functions for solving elliptic partial differential equations with variable coefficients and Cauchy-Navier equations (Q1997514) (← links)
- Localized meshless methods based on polynomial basis functions for solving axisymmetric equations (Q1998127) (← links)
- The LMAPS for solving fourth-order PDEs with polynomial basis functions (Q1998129) (← links)
- An efficient MAPS for solving fourth order partial differential equations using trigonometric functions (Q2004565) (← links)
- Hybrid method of space-time and Houbolt methods for solving linear time-dependent problems (Q2040761) (← links)
- An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\) (Q2053113) (← links)
- A predictor-corrector iterative method for solving linear least squares problems and perturbation error analysis (Q2067966) (← links)
- Exploiting higher computational efficiency index for computing outer generalized inverses (Q2120789) (← links)
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse (Q2132907) (← links)
- An efficient matrix iteration family for finding the generalized outer inverse (Q2148067) (← links)
- The method of particular solutions for solving nonlinear Poisson problems (Q2203748) (← links)
- An efficient matrix iterative method for computing Moore-Penrose inverse (Q2223078) (← links)
- Representation learning on unit ball with 3D roto-translational equivariance (Q2226187) (← links)
- A general class of arbitrary order iterative methods for computing generalized inverses (Q2244155) (← links)
- An efficient method of approximate particular solutions using polynomial basis functions (Q2288552) (← links)
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\) (Q2331707) (← links)
- A two-step inexact Newton-Chebyshev-like method for inverse eigenvalue problems (Q2332469) (← links)
- A high-order iterate method for computing \(A_{T, S}^{(2)}\) (Q2336680) (← links)
- Finding the Moore-Penrose inverse by a new matrix iteration (Q2354185) (← links)
- On finding robust approximate inverses for large sparse matrices (Q2929473) (← links)
- An efficient quadratically convergent iterative method to find the Moore–Penrose inverse (Q4976308) (← links)
- The LMAPS Using Polynomial Basis Functions for Near-Singular Problems (Q5156607) (← links)
- Local RBF Algorithms for Elliptic Boundary Value Problems in Annular Domains (Q5160529) (← links)
- A fast convergent iterative solver for approximate inverse of matrices (Q5502422) (← links)