|
Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > Numerical Linear Algebra (G.1.3) > Matrix Inversion (G.1.3...)
|
|
|
|
|
|
|
|
|
1-10 of 10
Reviews about "Matrix Inversion (G.1.3...)":
|
Date Reviewed |
|
Bayesian multi-tensor factorization Khan S., Leppäaho E., Kaski S. Machine Learning 105(2): 233-253, 2016. Type: Article
Data mining is increasingly facing the problem of extracting new knowledge from experimental data collected from complex phenomena. To extract hidden information, such datasets can be decomposed into the components that underlie them. ...
|
Feb 23 2017 |
|
Factorized sparse approximate inverses for preconditioning Huckle T. The Journal of Supercomputing 25(2): 109-117, 2003. Type: Article
Huckle derives preconditioning techniques based on factorized sparse approximate inverses for solving linear systems of algebraic equations, with a symmetric positive definite coefficient matrix. The preconditioner is derived either by...
|
Jan 27 2004 |
|
Efficient algorithms for the inclusion of the inverse matrix using error-bounds for hyperpower methods Herzberger J. Computing 46(4): 279-288, 1991. Type: Article
Let A be a nonsingular n × n real matrix and let p ≥ 2 be an integer. Suppose &fgr; p ( A , X ) is a function from the
|
Feb 1 1993 |
|
On the computation of a matrix inverse square root Sherif N. Computing 46(4): 295-305, 1991. Type: Article
Given an n -by- n nonsingular matrix A, the solution to X 2 A = I is called an inverse square root of A and is denoted by
|
Feb 1 1993 |
|
On some ways of approximating inverses of banded matrices in connection with deriving preconditioners based on incomplete block factorization Vassilevski P. Computing 43(3): 277-296, 1990. Type: Article
The author considers the problem of approximating the inverse of a block banded matrix, where “approximate” means either to obtain bounds on the size of the entries far away from the diagonal (bounding problem) or t...
|
Dec 1 1991 |
|
On recursive calculation of the generalized inverse of a matrix Mohideen S., Cherkassky V. ACM Transactions on Mathematical Software 17(1): 130-147, 1991. Type: Article
The notion of a generalized (or pseudo) inverse of a matrix extends the idea of the inverse of an ordinary square (and nonsingular) matrix to any matrix. The conventional application areas include linear optimization as well as least s...
|
Nov 1 1991 |
|
Efficient iterative algorithms for bounding the inverse of a matrix Herzberger J., Petkovic L. Computing 44(3): 237-244, 1990. Type: Article
It is well known that the use of interval arithmetic is more costly than ordinary floating-point computations. The purpose of this paper is to present an approach for bounding the inverse of a non-singular matrix, which combines iterat...
|
Feb 1 1991 |
|
On the convergence of an iterative method for bounding the inverses of an interval matrix Herzberger J. Computing 41(1-2): 153-162, 1989. Type: Article
Given an interval matrix A and an interval matrix X0 that contains the inverses of all matrices of A, the author gives explicit conditions (too complex to be stated here) for strictly reducing the width ...
|
Sep 1 1989 |
|
Report on test matrices for generalized inverses Zielke G. Computing 36(1-2): 105-162, 1986. Type: Article
This paper is a comprehensive report on test matrices for the generalized inversion of matrices. Two principles are described how to construct singular square or arbitrary rectangular test matrices and their Moore-Penrose inverses. By ...
|
Jun 1 1987 |
|
Parallel solution of certain toeplitz linear systems Bini D. SIAM Journal on Computing 13(2): 268-276, 1984. Type: Article
Parallel computational algorithms are presented for inversion of certain classes of Toeplitz matrix (i.e., matrices for which ai,j = &agr;i-j. Let A be a circulant Toeplitz matrix of orde...
|
Feb 1 1985 |
|
|
|
|
|
|