On the public citation graph

A divide and conquer method for unitary and orthogonal eigenproblems

0 signed · 66 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01389480openalex-snapshot

Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach

inferredcites →https://doi.org/10.1007/bf01396757openalex-snapshot

A divide and conquer method for the symmetric tridiagonal eigenproblem

inferredcites →https://doi.org/10.1016/0377-0427(86)90169-xopenalex-snapshot

The QR algorithm for unitary Hessenberg matrices

inferredcites →https://doi.org/10.1109/cdc.1986.267356openalex-snapshot

On the eigenproblem for orthogonal matrices

inferredcites →https://doi.org/10.1111/j.1365-246x.1973.tb03424.xopenalex-snapshot

The Retrieval of Harmonics from a Covariance Function

inferredcites →https://doi.org/10.1117/12.942026openalex-snapshot

Determination Of Pisarenko Frequency Estimates As Eigenvalues Of An Orthogonal Matrix

inferredcites →https://doi.org/10.1137/0609004openalex-snapshot

On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications

inferredcites →https://doi.org/10.1137/0908018openalex-snapshot

A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem

inferredcites →https://doi.org/10.1137/s089547989120195xopenalex-snapshot

A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/gamm.201490035openalex-snapshot

Structured Eigenvalue Problems

inferred← citeshttps://doi.org/10.1007/10984413_1openalex-snapshot

An Efficient QR Algorithm for a Hessenberg Submatrix of a Unitary Matrix

inferred← citeshttps://doi.org/10.1007/978-3-642-75536-1_18openalex-snapshot

Constructing a Unitary Hessenberg Matrix from Spectral Data

inferred← citeshttps://doi.org/10.1007/978-94-015-8196-7_19openalex-snapshot

Direct and Inverse Unitary Eigenproblems in Signal Processing: An Overview

inferred← citeshttps://doi.org/10.1007/s00211-009-0230-xopenalex-snapshot

Sensitivity analysis for Szegő polynomials

inferred← citeshttps://doi.org/10.1007/s002110050289openalex-snapshot

Inverse unitary eigenproblems and related orthogonal functions

inferred← citeshttps://doi.org/10.1007/s00365-021-09538-1openalex-snapshot

Markov’s Theorem for Weight Functions on the Unit Circle

inferred← citeshttps://doi.org/10.1016/0024-3795(91)90402-iopenalex-snapshot

Schur parameter pencils for the solution of the unitary eigenproblem

inferred← citeshttps://doi.org/10.1016/0024-3795(93)00188-6openalex-snapshot

On an inverse eigenvalue problem for unitary Hessenberg matrices

inferred← citeshttps://doi.org/10.1016/0024-3795(93)90469-5openalex-snapshot

Perturbation and interlace theorems for the unitary eigenvalue problem

inferred← citeshttps://doi.org/10.1016/0024-3795(95)00324-xopenalex-snapshot

Continuation methods for the computation of zeros of Szegö polynomials

inferred← citeshttps://doi.org/10.1016/0377-0427(93)90299-qopenalex-snapshot

On the construction of Szegő polynomials

inferred← citeshttps://doi.org/10.1016/0377-0427(95)00193-xopenalex-snapshot

Orthogonal matrix polynomials and applications

inferred← citeshttps://doi.org/10.1016/j.cam.2005.12.009openalex-snapshot

Szegő–Lobatto quadrature rules

inferred← citeshttps://doi.org/10.1016/j.cam.2007.01.006openalex-snapshot

Eigenvalue computation for unitary rank structured matrices

inferred← citeshttps://doi.org/10.1016/j.cam.2008.02.018openalex-snapshot

An interior-point method for large constrained discrete ill-posed problems

inferred← citeshttps://doi.org/10.1016/j.cam.2009.05.019openalex-snapshot

Quadrature formulas on the unit circle with prescribed nodes and maximal domain of validity

inferred← citeshttps://doi.org/10.1016/j.cam.2016.08.038openalex-snapshot

Generalized averaged Szegő quadrature rules

inferred← citeshttps://doi.org/10.1016/j.camwa.2008.07.024openalex-snapshot

Trigonometric orthogonal systems and quadrature formulae

inferred← citeshttps://doi.org/10.1016/j.jmr.2005.07.018openalex-snapshot

SPINEVOLUTION: A powerful tool for the simulation of solid and liquid state NMR experiments

inferred← citeshttps://doi.org/10.1016/j.laa.2005.04.025openalex-snapshot

Minimal representations of unitary operators and orthogonal polynomials on the unit circle

inferred← citeshttps://doi.org/10.1016/j.laa.2006.08.032openalex-snapshot

A Björck–Pereyra-type algorithm for Szegö–Vandermonde matrices based on properties of unitary Hessenberg matrices

inferred← citeshttps://doi.org/10.1016/j.laa.2007.09.034openalex-snapshot

An inexact Krylov–Schur algorithm for the unitary eigenvalue problem

inferred← citeshttps://doi.org/10.1016/j.laa.2013.10.008openalex-snapshot

A generalized unitary Hessenberg matrix

inferred← citeshttps://doi.org/10.1016/j.laa.2015.03.007openalex-snapshot

A CS decomposition for orthogonal matrices with application to eigenvalue computation

inferred← citeshttps://doi.org/10.1016/j.laa.2019.07.018openalex-snapshot

On monotonicity of zeros of paraorthogonal polynomials on the unit circle

inferred← citeshttps://doi.org/10.1016/j.laa.2021.02.031openalex-snapshot

Sampling the eigenvalues of random orthogonal and unitary matrices

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.008openalex-snapshot

Computations with quasiseparable polynomials and matrices

inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00491-xopenalex-snapshot

Polynomial zerofinders based on Szegő polynomials

inferred← citeshttps://doi.org/10.1016/s0377-0427(02)00486-7openalex-snapshot

The restarted QR-algorithm for eigenvalue computation of structured matrices

inferred← citeshttps://doi.org/10.1016/s0377-0427(97)00146-5openalex-snapshot

A new method for computing the stable invariant subspace of a real Hamiltonian matrix

inferred← citeshttps://doi.org/10.1016/s0377-0427(97)00148-9openalex-snapshot

Error bounds in the isometric Arnoldi process

inferred← citeshttps://doi.org/10.1016/s0377-0427(97)82122-xopenalex-snapshot

A numerical comparison of methods for solving secular equations

inferred← citeshttps://doi.org/10.1090/proc/14011openalex-snapshot

Refined interlacing properties for zeros of paraorthogonal polynomials on the unit circle

inferred← citeshttps://doi.org/10.1090/s0025-5718-06-01904-1openalex-snapshot

Anti-Szego quadrature rules

inferred← citeshttps://doi.org/10.1090/s0025-5718-97-00787-4openalex-snapshot

A unifying convergence analysis of second-order methods for secular equations

inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00884-9openalex-snapshot

Analysis of third-order methods for secular equations

inferred← citeshttps://doi.org/10.1109/cdc.1992.371167openalex-snapshot

Inverse problems for orthogonal matrices, Toda flows, and signal processing

inferred← citeshttps://doi.org/10.1137/050630787openalex-snapshot

Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem

inferred← citeshttps://doi.org/10.1137/0612031openalex-snapshot

Tridiagonal Approach to the Algebraic Environment of Toeplitz Matrices, Part II: Zero and Eigenvalue Problems

inferred← citeshttps://doi.org/10.1137/1035090openalex-snapshot

Some Perspectives on the Eigenvalue Problem

inferred← citeshttps://doi.org/10.1137/11085219xopenalex-snapshot

A Generalization of the Multishift QR Algorithm

inferred← citeshttps://doi.org/10.1137/19m1237272openalex-snapshot

Optimally Conditioned Vandermonde-Like Matrices

inferred← citeshttps://doi.org/10.1137/s0895479801383695openalex-snapshot

N Roots of the Secular Equation in O ( N ) Operations

inferred← citeshttps://doi.org/10.1137/s089547980139995xopenalex-snapshot

A Chart of Backward Errors for Singly and Doubly Structured Eigenvalue Problems

inferred← citeshttps://doi.org/10.1137/s089547989122017xopenalex-snapshot

Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem

inferred← citeshttps://doi.org/10.1137/s089547989223050xopenalex-snapshot

On a Sturm Sequence of Polynomials for Unitary Hessenberg Matrices

inferred← citeshttps://doi.org/10.1137/s089547989223924xopenalex-snapshot

A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem

inferred← citeshttps://doi.org/10.1137/s0895479893244572openalex-snapshot

Vector Orthogonal Polynomials and Least Squares Approximation

inferred← citeshttps://doi.org/10.1137/s0895479894270014openalex-snapshot

Residual Bounds on Approximate Solutions for the Unitary Eigenproblem

inferred← citeshttps://doi.org/10.1137/s0895479898333235openalex-snapshot

On the Perturbation Theory for Unitary Eigenvalue Problems

inferred← citeshttps://doi.org/10.1137/s0895479899359539openalex-snapshot

A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem

inferred← citeshttps://doi.org/10.1145/131766.131770openalex-snapshot

An implementation of a divide and conquer algorithm for the unitary eigen problem

inferred← citeshttps://doi.org/10.1201/b16113-74openalex-snapshot

Structured Eigenvalue Problems — Structure-Preserving Algorithms, Structured Error Analysis

inferred← citeshttps://doi.org/10.2298/fil2203005popenalex-snapshot

Anti-Gaussian quadrature rule for trigonometric polynomials

inferred← citeshttps://doi.org/10.48550/arxiv.1910.10243openalex-snapshot

Markov theorem for weight functions on the unit circle

inferred← citeshttps://doi.org/10.7273/000005620openalex-snapshot

Algorithms for the unitary eigenvalue problem

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.