Results 51 to 60 of about 17,645 (222)

Determinants of tridiagonal matrices over some commutative finite chain rings

open access: yesSpecial Matrices
Diagonal matrices and their generalization in terms of tridiagonal matrices have been of interest due to their nice algebraic properties and wide applications.
Jitman Somphong, Sricharoen Yosita
doaj   +1 more source

Combined Matrix of a Tridiagonal Toeplitz Matrix

open access: yesAxioms
In this work, combined matrices of tridiagonal Toeplitz matrices are studied. The combined matrix is known as the Relative Gain Array in control theory.
Begoña Cantó   +2 more
doaj   +1 more source

A note on the spectra of tridiagonal matrices

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2004
Using orthogonal polynomials, we give a different approach to some recent results on tridiagonal matrices.
C. M. da Fonseca, J. Petronilho
doaj   +1 more source

Large Deviations for Random Spectral Measures and Sum Rules [PDF]

open access: yes, 2011
We prove a Large Deviation Principle for the random spec- tral measure associated to the pair $(H_N; e)$ where $H_N$ is sampled in the GUE(N) and e is a fixed unit vector (and more generally in the $\beta$- extension of this model).
Gamboa, Fabrice, Rouault, Alain
core   +3 more sources

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

open access: yesAdvanced 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   +4 more
wiley   +1 more source

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

open access: yesJournal 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   +3 more
wiley   +1 more source

Non-Hermitian β-ensemble with real eigenvalues

open access: yesAIP Advances, 2013
By removing the Hermitian condition of the so-called β-ensemble of tridiagonal matrices, an ensemble of non-Hermitian random matrices is constructed whose eigenvalues are all real.
O. Bohigas, M. P. Pato
doaj   +1 more source

Approximate inverse preconditioners for linear systems arising from spatial balanced fractional diffusion equations

open access: yesAIMS Mathematics, 2023
We consider the preconditioned iterative methods for the linear systems arising from the finite volume discretization of spatial balanced fractional diffusion equations where the fractional differential operators are comprised of both Riemann-Liouville ...
Xiaofeng Guo, Jianyu Pan
doaj   +1 more source

Enumeration of simple random walks and tridiagonal matrices

open access: yes, 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   +23 more
core   +1 more source

Checking nonsingularity of tridiagonal matrices

open access: diamondThe Electronic Journal of Linear Algebra, 1999
In an earlier paper by \textit{I. Bar-On}, \textit{B. Codenotti} and \textit{M. Leoncini} [BIT 36, No. 2, 206-220 (1996; Zbl 0848.65029)] it was proved that checking robust nonsingularity of tridiagonal matrices can be performed in linear time. The present paper brings a detailed description of the algorithm.
Ilan Bar‐On
openalex   +4 more sources

Home - About - Disclaimer - Privacy