Results 31 to 40 of about 22,900 (243)

Improved Accuracy and Parallelism for MRRR-based Eigensolvers -- A Mixed Precision Approach [PDF]

, 2013
The real symmetric tridiagonal eigenproblem is of outstanding importance in numerical computations; it arises frequently as part of eigensolvers for standard and generalized dense Hermitian eigenproblems that are based on a reduction to tridiagonal form.
Bientinesi, Paolo, Petschow, Matthias, Quintana-Orti, Enrique   +2 more
core   +2 more sources

Orthogonal diagonalization for complex skew-persymmetric anti-tridiagonal Hankel matrices

Special Matrices, 2016
In this paper, we obtain an eigenvalue decomposition for any complex skew-persymmetric anti-tridiagonal Hankel matrix where the eigenvector matrix is orthogonal.
Gutiérrez-Gutiérrez Jesús, Zárraga-Rodríguez Marta   +1 more
doaj   +1 more source

Distributed NEGF Algorithms for the Simulation of Nanoelectronic Devices with Scattering [PDF]

, 2011
Through the Non-Equilibrium Green's Function (NEGF) formalism, quantum-scale device simulation can be performed with the inclusion of electron-phonon scattering.
Cheng-Kok Koh, Gerhard Klimeck, Mathieu Luisier, Oohashi T., Rozsa P., Rozsa P., Stephen Cauley, Torii T., Venkataramanan Balakrishnan   +8 more
core   +3 more sources

Change of basis for tridiagonal pairs of type II

Nuclear Physics B
This paper is on the topic of tridiagonal pairs of type II. These involve two linear transformations A and A⋆. We define two bases. In the first one, A acts as a diagonal matrix while A⋆ acts as a block tridiagonal matrix, and in the second one, A acts ...
Nicolas Crampé, Julien Gaboriaud, Satoshi Tsujimoto   +2 more
doaj   +1 more source

Bidiagonalization of (k, k + 1)-tridiagonal matrices

Special Matrices, 2019
In this paper,we present the bidiagonalization of n-by-n (k, k+1)-tridiagonal matriceswhen n < 2k. Moreover,we show that the determinant of an n-by-n (k, k+1)-tridiagonal matrix is the product of the diagonal elements and the eigenvalues of the matrix ...
Takahira S., Sogabe T., Usuda T.S.
doaj   +1 more source

Analytic solution of the Schrodinger equation for an electron in the field of a molecule with an electric dipole moment [PDF]

, 2007
We relax the usual diagonal constraint on the matrix representation of the eigenvalue wave equation by allowing it to be tridiagonal. This results in a larger solution space that incorporates an exact analytic solution for the non-central electric dipole
A.D. Alhaidari, Alhaidari, Alhaidari, Alhaidari, Alhaidari, Alhaidari, Alhaidari, Alhaidari, Alhaidari, Alhaidari, Altshuler, Barford, Bawin, Bonnrau, Bouaziz, Brown, Camblong, Camblong, Camblong, Chihara, Connolly, Coon, Crawford, Crawford, Crawford, Desfrancois, Desfrancois, Diez Muino, Essin, Fermi, Fox, Garett, Glasser, Henricks, Hurst, Ismail, Karat, Lykke, Lévy-Leblond, Magnus, Mead, Mittleman, Mittleman, Mullin, Serra, Turner, Wightman, Yamani   +47 more
core   +1 more source

Inversion of a tridiagonal jacobi matrix

Linear Algebra and its Applications, 1994
The author develops a formula for the inverse of a general tridiagonal matrix in terms of principal minors.
openaire   +1 more source

Quantum Iterative Methods for Solving Differential Equations with Application to Computational Fluid Dynamics

Advanced Quantum Technologies, EarlyView.
Quantum algorithms for differential equations are developed with applications in computational fluid dynamics. The methods follow an iterative simulation framework, implementing Jacobi and Gauss–Seidel schemes on quantum registers through linear combinations of unitaries.
Chelsea A. Williams, Antonio A. Gentile, Vincent E. Elfving, Daniel Berger, Oleksandr Kyriienko   +4 more
wiley   +1 more source

Enumeration of simple random walks and tridiagonal matrices

, 2002
We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration of weighted ...
Bauer M, Flajolet P, G M Cicuta, Gessel I, Goldsheid I Y, Goulden I P, Jani M, Jonsson T, Klarner D A, Krattenthaler C, L Molinari, Lee D S, M Contedini, Mansour T, Merlini D, Mohanty G, Noh J D, Raykin M, Sachov V, Sinai Ya G, Sinai Ya G, Stanley R P, Stanley R P, Wigner E   +23 more
core   +1 more source

On the Q‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure

Journal of Combinatorial Designs, Volume 34, Issue 2, Page 69-86, February 2026.
ABSTRACT Let Γ denote a finite, connected graph with vertex set X. Fix x ∈ X and let ε ≥ 3 denote the eccentricity of x. For mutually distinct scalars { θ i * } i = 0 ε define a diagonal matrix A * = A * ( θ 0 * , θ 1 * , … , θ ε * ) ∈ Mat X ( R ) as follows: for y ∈ X we let ( A * ) y y = θ ∂ ( x , y ) *, where ∂ denotes the shortest path length ...
Blas Fernández, Roghayeh Maleki, Štefko Miklavič, Giusy Monzillo   +3 more
wiley   +1 more source