Results 161 to 170 of about 1,655,330 (212)
Some of the next articles are maybe not open access.

Related searches:

On the Inverse of a General Tridiagonal Matrix

Applied Mathematics and Computation, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moawwad E A El-Mikkawy
exaly   +2 more sources

Householder's tridiagonalization of a symmetric matrix

Numerische Mathematik, 1968
In an early paper in this series [4] Householder’s algorithm for the tridiagonalization of a real symmetric matrix was discussed. In the light of experience gained since its publication and in view of its importance it seems worthwhile to issue improved versions of the procedure given there.
Martin, R. S.   +2 more
openaire   +2 more sources

On the Powers and the Inverse of a Tridiagonal Matrix

Applied Mathematics and Computation, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohamed Elouafi, Ahmed Driss Aiat Hadj
exaly   +4 more sources

Explicit Formula for the Inverse of a Tridiagonal Matrix by Backward Continued Fractions

open access: yesApplied Mathematics and Computation, 2008
In this paper, we consider a general tridiagonal matrix and give the explicit formula for the elements of its inverse. For this purpose, considering usual continued fraction, we de.
Emrah Kilic
exaly   +2 more sources

A Finite Procedure for the Tridiagonalization of a General Matrix

SIAM Journal on Matrix Analysis and Applications, 1995
Interest in the problem of the tridiagonalization of an arbitrary square complex matrix by similarity transformation has been renewed recently through work by Geist, Parlett, Tang and others. To our knowledge, no procedure has so far been presented to compute a tridiagonal matrix similar to a general square complex matrix that requires only a finite ...
Alan George   +3 more
openaire   +2 more sources

Tridiagonalization of a symetric band matrix

Numerische Mathematik, 1968
The well known method proposed by Givens [1] reduces a full symmetric matrix A = (a ik ) of order n by a sequence of appropriately chosen elementary orthogonal transformations (in the following called Jacobi rotations) to triput diagonal form. This is achieved by (n - 1)(n - 2)/2 Jacobi rotations, each of which annihilates one of the elements a ik with
openaire   +1 more source

The recreation of a tridiagonal matrix

USSR Computational Mathematics and Mathematical Physics, 1987
Abstract The problem of the recreation of a symmetric Jacobian matrix using the nodes and weights of the orthogonality of polynomials is considered. An algorithm is proposed which is based on a triangular expansion of a van der Mond matrix. The high efficiency of this algorithm is confirmed by numerical calculations.
I.V. Koshcheyeva, Yu.I. Kuznetsov
openaire   +1 more source

Home - About - Disclaimer - Privacy