Results 31 to 40 of about 9,096 (136)
, 2015 Basing on a modification of the "Dichotomy Algorithm" (Terekhov, 2010), we propose a parallel procedure for solving tridiagonal systems of equations with Toeplitz matrices.
Terekhov, Andrew V.
core +1 more source
Computer Graphics Forum, EarlyView.Abstract We introduce mixed super‐circles, a position‐curvature formulation of the original dynamic 2D super‐helix model. Compared to the latter, purely curvature‐based model – the so‐called chained formulation –, the mixed formulation that we propose here drastically reduces the algorithmic complexity of the solving scheme – from quadratic to quasi ...
Emile Hohnadel +2 more
wiley +1 more source
Iterative Krylov Subspace Methods for Linear Port‐Hamiltonian Systems
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 2, June 2026.ABSTRACT In this work, we present a structure‐preserving Krylov subspace iteration scheme for solving the equation systems that arise from the Gauss integration of linear energy‐conserving and dissipative differential systems (e.g., Poisson systems, gradient systems, and port‐Hamiltonian systems).
Stefan Maier, Nicole Marheineke
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 +23 more
core +1 more source
Euler‐Top Gaussian Modes: Structured Beams From Quadratic Angular Momentum Dynamics
Nanophotonics, Volume 15, Issue 9, 13 May 2026.A new family of structured Gaussian light beams are introduced: Euler‐top Gaussian modes. Their ray‐orbital paths on the Gaussian Poincaré sphere correspond to the polhodes of the Euler top in classical angular momentum theory. This geometric and algebraic construction reveals a nonseparable mode family extending the familiar Hermite‐, Laguerre‐ and ...
Mark R. Dennis, Kerr Maxwell
wiley +1 more source
Towards a classification of the tridiagonal pairs
Linear Algebra and its Applications, 2008 18 ...
Nomura, Kazumasa, Terwilliger, Paul
openaire +2 more sources
Tridiagonal pairs of q-Serre type and their linear perturbations
Journal of Algebra, 2022 A tridiagonal pair is an ordered pair of diagonalizable linear maps on a nonzero finite-dimensional vector space, that each act on the eigenspaces of the other in a block-tridiagonal fashion. We consider a tridiagonal pair $(A, A^*)$ of $q$-Serre type; for such a pair the maps $A$ and $A^*$ satisfy the $q$-Serre relations.
openaire +2 more sources
Surface Functional Renormalization Group for Layered Quantum Materials
Annalen der Physik, Volume 538, Issue 4, April 2026.This work introduces surface functional renormalization group, a powerful method for studying strong electron correlations at surfaces of layered quantum materials. Applying it to a 3D Hubbard‐SSH model reveals how bulk coupling reshapes surface phases, uncovering regimes of antiferromagnetism, ferromagnetism, d‐wave superconductivity, and possible ...
Lennart Klebl, Dante M. Kennes
wiley +1 more source
Affine transformations of a sharp tridiagonal pair
Linear Algebra and its Applications, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hou, Bo, Yang, Longmei, Gao, Suogang
openaire +1 more source
Minimizing Communication for Eigenproblems and the Singular Value Decomposition [PDF]
, 2010 Algorithms have two costs: arithmetic and communication. The latter represents the cost of moving data, either between levels of a memory hierarchy, or between processors over a network.
Ballard, Grey +2 more
core +1 more source