Results 31 to 40 of about 9,075 (140)
On the Q‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure
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
Affine transformations of a sharp tridiagonal pair
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hou, Bo, Yang, Longmei, Gao, Suogang
openaire +1 more source
Tridiagonal pairs, alternating elements, and distance-regular graphs
39 pages, 9 ...
openaire +3 more sources
The cryptohermitian smeared-coordinate representation of wave functions
The one-dimensional real line of coordinates is replaced, for simplification or approximation purposes, by an N-plet of the so called Gauss-Hermite grid points. These grid points are interpreted as the eigenvalues of a tridiagonal matrix $\mathfrak{q}_0$
Abramowitz +22 more
core +1 more source
The Block Preconditioned SOR Method for Solving Indefinite Complex Linear Systems
ABSTRACT In this paper we extend the theory of a block preconditioned SOR method studied by Hezari, Edalaptour, and Salkuyeh (2015) for the solution of indefinite complex linear systems. In particular, we consider the case where the key matrix S$$ S $$ has real eigenvalues which lie in (−∞,+∞)$$ \left(-\infty, +\infty \right) $$ and not only in [0,+∞)$$
M. A. Louka, N. M. Missirlis
wiley +1 more source
Enumeration of simple random walks and tridiagonal matrices
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
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
Tridiagonal pairs and the Askey–Wilson relations
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
ClimaLand: A Land Surface Model Designed to Enable Data‐Driven Parameterizations
Abstract Land surface models (LSMs) are essential tools for simulating the coupled climate system, representing the dynamics of water, energy, and carbon fluxes on land and their interaction with the atmosphere. However, parameterizing sub‐grid processes at the scales relevant to climate models (∼ ${\sim} $10–100 km) remains a considerable challenge ...
Katherine Deck +21 more
wiley +1 more source
Tridiagonal and single-pair matrices and the inverse sum of two single-pair matrices
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent factorizations are established, leading to semi-closed-form formulas for the inverse sum of two single-pair matrices ...
openaire +2 more sources

