Results 11 to 20 of about 23,326 (218)
This paper presents an algorithm to construct a tridiagonal matrix factored by bidiagonal matrices with prescribed eigenvalues and specified matrix entries.
Koichi Kondo
doaj +2 more sources
Tridiagonal matrix representations of cyclic self-adjoint operators. II [PDF]
A bounded cyclic self-adjoint operator C defined on a separable Hilbert space H can be represented as a tridiagonal matrix with respect to the basis generated by the cyclic vector. An operator J can then be defined so that CJ − JC = −2iK where K also has tridiagonal form.
J. Dombrowski
openalex +8 more sources
Explicit inverse of a tridiagonal k−Toeplitz matrix [PDF]
We obtain explicit formulas for the entries of the inverse of a nonsingular and irreducible tridiagonal k−Toeplitz matrix A. The proof is based on results from the theory of orthogonal polynomials and it is shown that the entries of the inverse of such a matrix are given in terms of Chebyshev polynomials of the second kind.
Carlos M. da Fonseca, J. Petronilho
openalex +5 more sources
Algorithm 122: Tridiagonal matrix [PDF]
Gerard F. Dietzel
openalex +3 more sources
Certification of algorithm 122: Tridiagonal matrix [PDF]
Peter Naur
openalex +3 more sources
The characterization of inverses of symmetric tridiagonal and block tridiagonal matrices and the development of algorithms for finding the inverse of any general non-singular tridiagonal matrix are subjects that have been studied by many authors.
C. G. Almeida, S. A. E. Remigio
doaj +1 more source
Ultralow-Dimensionality Reduction for Identifying Critical Transitions by Spatial-Temporal PCA. [PDF]
The proposed spatial‐temporal principal component analysis (stPCA) method analytically reduces high‐dimensional time‐series data to a single latent variable by transforming spatial information into temporal dynamics. By preserving the temporal properties of the original data, stPCA effectively identifies critical transitions and tipping points.
Chen P+6 more
europepmc +2 more sources
Symbolic Algorithm for Inverting General k-Tridiagonal Interval Matrices
The k-tridiagonal matrices have received much attention in recent years. Many different algorithms have been proposed to improve the efficiency of k-tridiagonal matrix estimation.
Sivakumar Thirupathi+1 more
doaj +1 more source
On the Generalized Gaussian Fibonacci Numbers and Horadam Hybrid Numbers: A Unified Approach
In this paper, we consider an approach based on the elementary matrix theory. In other words, we take into account the generalized Gaussian Fibonacci numbers. In this context, we consider a general tridiagonal matrix family.
Fatih Yılmaz, Mustafa Özkan
doaj +1 more source
In this paper, our main attention is paid to calculate the determinants and inverses of two types Toeplitz and Hankel tridiagonal matrices with perturbed columns.
Fu Yaru+3 more
doaj +1 more source