Results 191 to 200 of about 23,326 (218)

Unveiling the Power of Implicit Six-Point Block Scheme: Advancing numerical approximation of two-dimensional PDEs in physical systems. [PDF]

PLoS One
Olaoluwa Omole E, Olusheye Adeyefa E, Iyabo Apanpa K, Iyadunni Ayodele V, Emmanuel Amoyedo F, Emadifar H.   +5 more
europepmc   +1 more source

The Quantum Transport of Dirac Fermions in Selected Graphene Nanosystems Away from the Charge Neutrality Point. [PDF]

Materials (Basel)
Rycerz A.
europepmc   +1 more source

A method for chromatin domain partitioning based on hypergraph clustering. [PDF]

Comput Struct Biotechnol J
Gong H, Zhang S, Zhang X, Chen Y.
europepmc   +1 more source

The Goldilocks principle of learning unitaries by interlacing fixed operators with programmable phase shifters on a photonic chip. [PDF]

Sci Rep
Zelaya K, Markowitz M, Miri MA.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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.
C. Reinsch, James Hardy Wilkinson, R. S. Martin   +2 more
openaire   +2 more sources

On the inverse of a quasi-tridiagonal matrix

International Journal of Computer Mathematics, 1986
Explicit relations are derived between the elements of the inverse of a quasi-tridiagonal matrix and the elements of the inverse of the associated tridiagonal matrix. These relations are used to compute the quasi-tridiagonal inverse assuming that the tridiagonal inverse is known.
W. M. Pickering, M. J. Piff
openaire   +2 more sources

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.
Y. I. Kuznetsov, I. V. Koshcheyeva
openaire   +2 more sources

Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix

Numerische Mathematik, 2012
Several relative eigenvalue condition numbers that exploit tridiagonal form are derived. Some of them use triangular factorizations instead of the matrix entries and so they shed light on when eigenvalues are less sensitive to perturbations of factored forms than to perturbations of the matrix entries. A novel empirical condition number is used to show
Ferreira, Carla, Parlett, Beresford, Dopico, Froilán M.   +2 more
openaire   +3 more sources

An explicit inverse of a tridiagonal matrix

International Journal of Computer Mathematics, 1983
An explicit expression for the inverse of an invertible, real tridiagonal matrix is obtained, and its principal structural properties are determined. An efficient and stable algorithm is developed by utilising these properties.
Huw O. Pritchard, S.R. Vatsya
openaire   +2 more sources