Pith. sign in

REVIEW 7 minor 55 references

Compression Properties for large Toeplitz-like matrices

T0 review · 0 major / 7 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proves explicit ε-rank bounds for the off-diagonal blocks of a Cauchy-like transformed Toeplitz-like matrix: every (m, sep) block has ε-rank at most ρ (2/π²) log(4(m+sep−1)/sep) log(4/ε), which is O(ρ log m log 1/ε) in the…

desk verdict New, correct epsilon-rank bounds for the weakly admissible case in Toeplitz-like compression; the disputed normalization in Theorem 2.2 is valid but terse, and the paper deserves a serious referee. read the letter →

arxiv 2502.09823 v2 pith:GZYYSJ3I submitted 2025-02-13 math.NA cs.NA

Bernhard Beckermann , Daniel Kressner , Heather Wilber This is my paper · ORCID
classification math.NAcs.NA MSC 15B0515A1815A2315A0665F0541A20
keywords Toeplitzmatricesdisplacementstructureepsilon-rankZolotarevnumbershierarchicallow-rankapproximationHSSADImethodsuperfastsolver
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper gives the first rigorous, explicit bounds on the numerical (ε-)rank of the off-diagonal submatrices that arise when a Toeplitz-like matrix is transformed into Cauchy-like form by a discrete Fourier transform. The bounds show that every (m,sep) off-diagonal block has ε-rank at most ρ (2/π²) log(4(m+sep−1)/sep) log(4/ε), which is O(ρ log m log 1/ε) in the weakly admissible setting and O(ρ log 1/ε) when the block is well separated from the diagonal. A sympathetic reader should care because these estimates provide the missing a priori justification for using HODLR, HSS, and other hierarchical low-rank formats inside superfast Toeplitz solvers, and they lead to a deterministic, adaptive compression algorithm whose cost and error are controlled by the same bounds.

What carries the argument

The load-bearing object is the Zolotarev number Z_k(E1,E2), the infimum over rational functions of degree (k,k) of sup_{E1}|r| / inf_{E2}|r|, for two disjoint arcs E1,E2 of the unit circle. The paper proves that the submatrix's displacement equation can be reduced to this setting, and that the Möbius transform of the arcs turns the Zolotarev problem into one for real intervals where known bounds apply. The same Zolotarev rational functions supply the shift parameters for the fADI iteration used to construct the low-rank factors, so the theoretical bound directly becomes an algorithm.

What would settle it

Take n=8, m=2, sep=1, let J={2,...,7}, K={0,1}, and examine the normalized eigenvalue sets $ω^{{-2j-m+1}}$$ω^{{2j}}$ for j∈J and k∈K; if they do not lie in the arcs [β,2π−β] and [−α,α] with α=π(m−1)/n, β=π(m−1+2sep)/n, the proof's containment step is wrong, and the Zolotarev bound cannot be invoked.

Watch

Extended reading notes

Core claim

The central claim is Theorem 2.2: for any (m, sep) submatrix C_{JK} of the transformed Cauchy-like matrix C, rank_ε(C_{JK}) ≤ ρ (2/π²) log(4(m+sep−1)/sep) log(4/ε). The proof shows that C_{JK} satisfies a Sylvester equation with diagonal coefficients, that the spectra of these diagonals can be placed in disjoint arcs of the unit circle, and that the Zolotarev number for these arcs decays exponentially with rate given by (2.11). This yields the first effective rank bounds that cover both weakly admissible (sep=1) and strongly admissible (sep≥m+1) block partitions, and it explains why the practical randomized compression of Toeplitz matrices works as well as it does.

Load-bearing premise

The central bound assumes that the eigenvalue sets of the two diagonal matrices in the submatrix displacement equation can always be enclosed in two disjoint arcs of the unit circle with the required gap; the proof's normalization step for achieving this containment is not fully justified as written.

Editorial extensions

If this is right

  • Every off-diagonal block of C in a weakly admissible hierarchical partition has ε-rank O(ρ log m log 1/ε), so HODLR and HSS ranks remain small even for very large n.
  • In the strongly admissible case (sep≥m+1), the ε-rank is O(ρ log 1/ε), independent of n, suggesting that linear-complexity direct solvers using strong-admissibility formats are within reach.
  • The fADI-based interpolative decompositions give a deterministic counterpart to the randomized Toeplitz solver, with explicit a priori rank choices and guaranteed error bounds.
  • The bounds justify the use of weakly admissible formats such as HODLR and HSS, which prior analyses could not handle in the sep=1 case.
  • The overall HSS-based solver for T x=b runs in O(n(ρ log n log 1/ε)^2) operations, matching randomized methods in practice.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same displacement-arc technique should extend to other unitary similarity transforms of Toeplitz-like matrices, not just the DFT, as long as the generator eigenvalues lie on a circle or a curve with controlled geometry.
  • The strong-admissibility bound suggests a hierarchical solver that switches from weak to strong admissibility at deeper levels could reach near-linear complexity, which the authors note but do not implement.
  • One could test the sharpness of the constant 2/π² by comparing the bound to numerically computed Zolotarev numbers for the arcs; the gap may reveal whether the factor 4 in the log is loose.
  • The deterministic fADI-based compression could be combined with randomized column subset selection to reduce the hidden constant in practice while preserving the theoretical guarantees.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 7 minor

Summary. The paper analyzes the numerical low-rank structure of the Cauchy-like matrix C obtained by applying a unitary Fourier transform to a Toeplitz-like matrix T with small displacement rank. The main result, Theorem 2.2, gives explicit ε-rank bounds for off-diagonal submatrices of C in terms of the displacement rank ρ, the block width m, and the separation parameter sep, covering both weak admissibility (sep = 1) and strong admissibility (sep ≥ m + 1). The bounds are derived from Zolotarev numbers and the authors use them to design fADI-based, deterministic HODLR and HSS compression algorithms, with numerical experiments illustrating the performance of a resulting Toeplitz solver.

Significance. If the results hold, the paper provides a substantial theoretical explanation for a compressibility phenomenon that is widely exploited in superfast Toeplitz solvers. The bounds have explicit constants, are parameter-free, and cover the weakly admissible case that earlier kernel-based analyses could not handle. The paper also offers a deterministic alternative to randomized HSS construction and gives explicit quasi-optimal fADI shift parameters via elliptic functions. These are concrete and checkable contributions, and the numerical experiments support the claims. The main derivation builds on the published, general Zolotarev bound of Beckermann and Townsend, so there is no circularity or fitted-parameter concern.

minor comments (7)
  1. [§2.3, proof of Theorem 2.2] The sentence 'By multiplying both sides of this equation with ω^{-2j-m+1}, we may assume without loss of generality...' is too terse for the central proof. The multiplication rotates both spectra by the same angle, and the subsequent arc containment for D_K and D_J follows from the two separation conditions in Definition 2.1, but this chain of reasoning should be written out explicitly. In particular, the phrase 'for some k ≥ 0' appears to be a typo and should read 'for some j'.
  2. [Theorem 2.2, Eq. (2.6)] Since rank_ϵ is integer-valued, the bound in (2.6) should include a ceiling (or an additive +1 absorbed into the constant) on the quantity (2/π²) log(4(m+sep-1)/sep) log(4/ε). As written, the step from the exponential bound (2.11) to (2.6) is not rigorously valid for non-integer values; the asymptotic statement is unaffected.
  3. [§4.3.1 and Lemma 4.2] Please specify the fADI shift parameters used for HSS rows and columns. For an HSS row X = C_row_v, the coefficient spectrum of D_J is the small arc while the spectrum of D_K is the large complementary arc, which is the reverse of the orientation in Theorem 2.2 and Corollary 3.1. The authors should state explicitly whether the roles of τ_j and ν_j from Lemma 2.4 are interchanged in this setting; as written, the 'straightforward extension of Corollary 3.1' leaves this ambiguity.
  4. [Corollary 3.2 proof] The claim that the 2-norm of all errors committed on a fixed HODLR level ℓ remains bounded by ϵ∥C∥/log₂ n deserves a sentence of justification. It is true because the level-ℓ errors have a block-diagonal structure with 2×2 off-diagonal blocks, so the spectral norm is controlled by the maximum block norm, but this structural observation is not stated.
  5. [Figure 2 caption] The caption refers to 'randomly chosen B,C' without defining these matrices; they should be identified as the generator matrices (or as eG, eH) used in the displacement equation (2.2).
  6. [Lemma 4.2, Eq. (4.7)] There is a typographical issue in the expression for ξ: 'ξ = exp(π²/(2 log(4m))' is missing a closing parenthesis. In addition, the parameter p in the lemma statement should be defined as p = kρ in the text before it is used in the error bound.
  7. [§5, HSS complexity] The complexity bound O(n(ρ log n log 1/ε)²) for the HSS construction is stated to follow from [53, Ch. 4]. Since this is a PhD dissertation and may not be readily accessible, a short cost-accounting summary in the paper would improve self-containedness.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the central rank bound derives from an external parameter-free Zolotarev theorem, and no fitted or self-referential quantity is relabeled as a prediction.

full rationale

The load-bearing estimate in Theorem 2.2 is obtained by applying the general displacement-structure bound (2.3) from [6] (Beckermann-Townsend) to the submatrix equation (2.5). That bound is external, published, parameter-free, and its stated assumptions (normal diagonal coefficients with disjoint spectra) do not include the Toeplitz compressibility conclusion being proved; it applies to any displacement-structured matrix with a suitable right-hand side. The proof then uses Definition 2.1 to position the spectra of DJ and DK on disjoint arcs, along with a scalar rotation of the displacement equation; the subsequent Zolotarev estimates rely on standard external tools (Mobius invariance from [6], elliptic-function results from [1] and [19], and the NIST bound [41]). No fitted constant, no data-dependent parameter, and no quantity defined in terms of the target rank appears in the derivation. Corollaries 3.1, 3.2, Lemma 4.1, and Lemma 4.2 propagate the same independent bound to fADI and HODLR/HSS constructions; Figure 2 compares the bound to computed singular values without tuning. The only self-citations that play a central role are [6] and [53]; [6] is independent support by the hard-rule criteria, and [53] supplies implementation details of HSS merging and complexity analysis rather than the compressibility result itself. The possible concern about the normalization in the proof of Theorem 2.2 concerns the validity of the arc containment, not whether the bound reduces to its own assumptions; it is a correctness question and therefore does not affect the circularity score.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The central claim rests on standard Zolotarev approximation theory and the displacement structure of Toeplitz-like matrices. No free parameters are fitted to data: the bounds are parameter-free in terms of rho, m, sep, and epsilon. No new physical or mathematical entities are postulated.

assumptions (7)
  • standard math Zolotarev number bound: sigma_{k*rho+1}(X) <= Z_k(E1,E2) * ||X||_2 for solutions of A*X - X*B = Y with normal A, B and disjoint spectra
    Invoked in equation (2.3) and used as the engine for Theorem 2.2. From [6], an external published result.
  • standard math Mobius invariance of Zolotarev numbers and the explicit bound Z_k(intervals) <= 4 * rho_0^{-2k}
    Used after the Cayley/Mobius map in the proof of Theorem 2.2, citing [6, Cor. 4.2].
  • standard math The inequality mu(1/sqrt(gamma)) <= log(4 sqrt(gamma)) for the Grotzsch ring function
    Used in (2.10) to obtain the explicit log(m/sep) dependence, from [41, 19.9.5].
  • standard math Zeros and poles of the Zolotarev rational function are given by elliptic functions as in Lemma 2.4
    Used to choose fADI shift parameters; standard solution of Zolotarev's third problem.
  • domain assumption The Toeplitz-like matrix T satisfies the Sylvester displacement equation (1.1) with small rank rho, and the transformed C satisfies (2.2)
    This is the definition of Toeplitz-like matrices and the starting point of the analysis.
  • domain assumption The HSS construction error is bounded via [32, Thm. 4.7] from the (epsilon,T)-HSS rank
    Used in Section 4 to convert row and column rank bounds into a global HSS approximation error bound.
  • domain assumption n is a power of two for the HODLR and HSS partitioning
    Assumed at the start of Section 3 to simplify the tree structure; not a loss of generality for the analysis.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Compression Properties for large Toeplitz-like matrices." pith.science (2026). https://pith.science/paper/GZYYSJ3I

@misc{pith2026250209823,
  author       = {Pith},
  title        = {Pith review of: Compression Properties for large Toeplitz-like matrices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GZYYSJ3I}},
  note         = {Machine review of arXiv:2502.09823}
}
read the original abstract

Toeplitz matrices are abundant in computational mathematics, and there is a rich literature on the development of fast and superfast algorithms for solving linear systems involving such matrices. Any Toeplitz matrix can be transformed into a matrix with off-diagonal blocks that are of low numerical rank.This compressibility is relied upon in practice in a number of superfast Toeplitz solvers. In this paper, we show that the compression properties of these matrices can be thoroughly explained using their displacement structure. We provide explicit bounds on the numerical ranks of important submatrices that arise when applying HSS, HODLR and other approximations with hierarchical low-rank structure to transformed Toeplitz and Toeplitz-like matrices. Our results lead to very efficient displacement-based compression strategies that can be used to formulate adaptive superfast rank-structured solvers.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

55 extracted references · 51 canonical work pages

  1. [55]

    J. Xia, Y. Xi, and M. Gu, A superfast structured solver for Toeplitz linear systems via ran- domized sampling, SIAM J. Matrix Anal. Appl., 33 (2012), pp. 837–858. 22

    work page 2012

  2. [6]

    Beckermann and A

    B. Beckermann and A. Townsend, Bounds on the singular values of matrices with displace- ment structure, SIAM Rev., 61 (2019), pp. 319–344

    work page 2019

  3. [53]

    H. D. Wilber, Computing numerically with rational functions , PhD thesis, Cornell University, 2021

    work page 2021

  4. [1]

    N. I. Akhiezer, Elements of the theory of elliptic functions , vol. 79 of Translations of Mathe- matical Monographs, AMS, Providence, RI, 1990

    work page 1990

  5. [2]

    Ambikasaran and E

    S. Ambikasaran and E. Darve , The inverse fast multipole method , arXiv preprint arXiv:1407.1572, (2014)

    arXiv 2014

  6. [3]

    A. C. Antoulas, Approximation of large-scale dynamical systems , vol. 6, SIAM, 2005

    work page 2005

  7. [4]

    Ballani and D

    J. Ballani and D. Kressner, Matrices with hierarchical low-rank structures , vol. 2173 of Lecture Notes in Math., Springer, Cham, 2016, pp. 161–209

    work page 2016

  8. [5]

    Bebendorf, Hierarchical matrices, Springer, 2008

    M. Bebendorf, Hierarchical matrices, Springer, 2008

    work page 2008

Show all 55 references
  1. [7]

    Benner, R.-C

    P. Benner, R.-C. Li, and N. Truhar, On the ADI method for Sylvester equations, J. Comput. Appl. Math., 233 (2009), pp. 1035–1045

    2009

  2. [8]

    B¨orm, Efficient numerical methods for non-local operators , vol

    S. B¨orm, Efficient numerical methods for non-local operators , vol. 14 of EMS Tracts in Math- ematics, EMS, Z¨ urich, 2010

    2010

  3. [9]

    Braess and W

    D. Braess and W. Hackbusch, On the efficient computation of high-dimensional integrals and the approximation by exponential sums , in Multiscale, nonlinear and adaptive approx- imation, Springer, Berlin, 2009, pp. 39–74

    2009

  4. [10]

    M. E. Broadbent, M. Brown, K. Penner, I. Ipsen, and R. Rehman, Subset selection al- gorithms: Randomized vs. deterministic , SIAM undergraduate research online, 3 (2010), pp. 50–71

    2010

  5. [11]

    A. A. Casulli, D. Kressner, and L. Robol, Computing functions of symmetric hierarchically semiseparable matrices, SIAM J. Matrix Anal. Appl., 45 (2024), pp. 2314–2338

    2024

  6. [12]

    Chandrasekaran, M

    S. Chandrasekaran, M. Gu, and T. Pals, A fast UL V decomposition solver for hierarchically semiseparable representations, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 603–622

    2006

  7. [13]

    Chandrasekaran, M

    S. Chandrasekaran, M. Gu, X. Sun, J. Xia, and J. Zhu, A superfast algorithm for Toeplitz systems of linear equations , SIAM J. Matrix Anal. Appl., 29 (2007), pp. 1247–1266

    2007

  8. [14]

    Cheng, Z

    H. Cheng, Z. Gimbutas, P.-G. Martinsson, and V. Rokhlin, On the compression of low rank matrices, SIAM J. Sci. Comput., 26 (2005), pp. 1389–1404

    2005

  9. [15]

    Cortinovis and D

    A. Cortinovis and D. Kressner, Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation , arXiv preprint arXiv:2412.13992, (2024)

    2024 arXiv

  10. [16]

    T. A. Driscoll, Schwarz-Christoffel toolbox user’s guide , tech. rep., Cornell University, 1994. 20

    1994

  11. [17]

    Druskin, L

    V. Druskin, L. Knizhnerman, and V. Simoncini, Analysis of the rational Krylov subspace and ADI methods for solving the Lyapunov equation , SIAM J. Numer. Anal., 49 (2011), pp. 1875–1898

    2011

  12. [18]

    Dutt and V

    A. Dutt and V. Rokhlin, Fast Fourier transforms for nonequispaced data, II, Appl. Comput. Harm.Anal., 2 (1995), pp. 85–100

    1995

  13. [19]

    Fortunato and A

    D. Fortunato and A. Townsend, Fast Poisson solvers for spectral methods , IMA J. Numer. Anal., 40 (2020), pp. 1994–2018

    2020

  14. [20]

    Gohberg, T

    I. Gohberg, T. Kailath, and V. Olshevsky, Fast Gaussian elimination with partial pivoting for matrices with displacement structure , Math. of Comp., 64 (1995), pp. 1557–1576

    1995

  15. [21]

    G. H. Golub and C. F. V an Loan, Matrix computations , Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, MD, fourth ed., 2013

    2013

  16. [22]

    Grasedyck, Existence of a low rank or H-matrix approximant to the solution of a Sylvester equation, Numer

    L. Grasedyck, Existence of a low rank or H-matrix approximant to the solution of a Sylvester equation, Numer. Linear Algebra Appl., 11 (2004), pp. 371–389

    2004

  17. [23]

    R. M. Gray, Toeplitz and circulant matrices: A review , Found. and Trends® in Comm. and Inf. Theory, 2 (2006), pp. 155–239

    2006

  18. [24]

    Grenander and G

    U. Grenander and G. Szeg¨o, Toeplitz forms and their applications , California Monographs in Mathematical Sciences, University of California Press, Berkeley-Los Angeles, 1958

    1958

  19. [25]

    Gu and S

    M. Gu and S. C. Eisenstat, Efficient algorithms for computing a strong rank-revealing QR factorization, SIAM J. Sci. Comput., 17 (1996), pp. 848–869

    1996

  20. [26]

    Hackbusch, Hierarchical matrices: algorithms and analysis , vol

    W. Hackbusch, Hierarchical matrices: algorithms and analysis , vol. 49, Springer, 2015

    2015

  21. [27]

    Hackbusch, B

    W. Hackbusch, B. N. Khoromskij, and R. Kriemann, Hierarchical matrices based on a weak admissibility criterion , Computing, 73 (2004), pp. 207–243

    2004

  22. [28]

    Halko, P.-G

    N. Halko, P.-G. Martinsson, and J. A. Tropp, Finding structure with randomness: Prob- abilistic algorithms for constructing approximate matrix decompositions , SIAM Rev., 53 (2011), pp. 217–288

    2011

  23. [29]

    Heinig and K

    G. Heinig and K. Rost, Algebraic methods for Toeplitz-like matrices and operators , vol. 13 of Operator Theory: Advances and Applications, Birkh¨ auser Verlag, Basel, 1984

    1984

  24. [30]

    Huckle, Superfast solution of linear equations with low displacement rank , in High perfor- mance algorithms for structured matrix problems, vol

    T. Huckle, Superfast solution of linear equations with low displacement rank , in High perfor- mance algorithms for structured matrix problems, vol. 2 of Adv. Theory Comput. Math., Nova Sci. Publ., Commack, NY, 1998, pp. 149–162

    1998

  25. [31]

    Kailath and A

    T. Kailath and A. H. Sayed, Displacement structure: theory and applications , SIAM Rev., 37 (1995), pp. 297–386

    1995

  26. [32]

    Kressner, S

    D. Kressner, S. Massei, and L. Robol, Low-rank updates and a divide-and-conquer method for linear matrix equations , SIAM J. Sci. Comput., 41 (2019), pp. A848–A876

    2019

  27. [33]

    Lebedev, On a Zolotarev problem in the method of alternating directions , USSR Comput

    V. Lebedev, On a Zolotarev problem in the method of alternating directions , USSR Comput. Math. Math.Phys., 17 (1977), pp. 58–76

    1977

  28. [34]

    Lepilov and J

    M. Lepilov and J. Xia, Rank-structured approximation of some Cauchy matrices with sub- linear complexity, Numer. Linear Algebra Appl., 31 (2024), pp. Paper No. e2526, 22

    2024

  29. [35]

    Li and J

    J.-R. Li and J. White, Low rank solution of Lyapunov equations, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 260–280

    2002

  30. [36]

    Lu and E

    A. Lu and E. L. W achspress, Solution of Lyapunov equations by alternating direction implicit iteration, Comput. Math. Appl., 21 (1991), pp. 43–58

    1991

  31. [37]

    Martinsson, A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix , SIAM J

    P.-G. Martinsson, A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix , SIAM J. Matrix Anal. Appl., 32 (2011), pp. 1251–1274

    2011

  32. [38]

    Martinsson, V

    P.-G. Martinsson, V. Rokhlin, and M. Tygert, A fast algorithm for the inversion of general Toeplitz matrices, Comput. Math. Appl., 50 (2005), pp. 741–752

    2005

  33. [39]

    Massei, L

    S. Massei, L. Robol, and D. Kressner, hm-toolbox: Matlab software for HODLR and HSS matrices, SIAM J. Sci. Comput., 42 (2020), pp. C43–C68

    2020

  34. [40]

    Minden, K

    V. Minden, K. L. Ho, A. Damle, and L. Ying, A recursive skeletonization factorization based on strong admissibility , Multiscale Model. Simul., 15 (2017), pp. 768–796

    2017

  35. [41]

    F. W. Olver, D. W. Lozier, R. F. Boisvert, and C. W. Clark, NIST handbook of mathe- matical functions, Cambridge University Press, 2010

    2010

  36. [42]

    I. V. Oseledets, Lower bounds for separable approximations of the Hilbert kernel , Mat. Sb., 198 (2007), pp. 137–144

    2007

  37. [43]

    Osinsky, Close to optimal column approximations with a single SVD , arXiv preprint arXiv:2308.09068, (2023)

    A. Osinsky, Close to optimal column approximations with a single SVD , arXiv preprint arXiv:2308.09068, (2023)

    2023 arXiv

  38. [44]

    Ou and J

    X. Ou and J. Xia, SuperDC: superfast divide-and-conquer eigenvalue decomposition with im- proved stability for rank-structured matrices, SIAM J. Sci. Comput., 44 (2022), pp. A3041– A3066

    2022

  39. [45]

    V. Y. Pan, Structured matrices and polynomials: unified superfast algorithms, Springer Science & Business Media, 2012

    2012

  40. [46]

    D. W. Peaceman and H. H. Rachford, The numerical solution of parabolic and elliptic 21 differential equations, J. Soc. Ind. Appl. Math., 3 (1955), pp. 28–41

    1955

  41. [47]

    Penzl, Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case , Systems Control Lett., 40 (2000), pp

    T. Penzl, Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case , Systems Control Lett., 40 (2000), pp. 139–144

    2000

  42. [48]

    Rubin, A

    D. Rubin, A. Townsend, and H. Wilber, Bounding Zolotarev numbers using Faber rational functions, Const. Approx., 56 (2022), pp. 207–232

    2022

  43. [49]

    Sabino, Solution of large-scale Lyapunov equations via the block modified Smith method , PhD thesis, Rice University, 2007

    J. Sabino, Solution of large-scale Lyapunov equations via the block modified Smith method , PhD thesis, Rice University, 2007

    2007

  44. [50]

    Townsend and H

    A. Townsend and H. Wilber, On the singular values of matrices with high displacement rank , Linear Algebra Appl., 548 (2018), pp. 19–41

    2018

  45. [51]

    Tyrtyshnikov, Mosaic-skeleton approximations, Calcolo, 33 (1996), pp

    E. Tyrtyshnikov, Mosaic-skeleton approximations, Calcolo, 33 (1996), pp. 47–57

    1996

  46. [52]

    E. L. W achspress, Optimum alternating-direction-implicit iteration parameters for a model problem, J. Soc. for Ind. and Appl. Math., 10 (1962), pp. 339–350

    1962

  47. [54]

    J. Xia, S. Chandrasekaran, M. Gu, and X. S. Li, Fast algorithms for hierarchically semisep- arable matrices, Numer. Lin. Alg. Appl., 17 (2010), pp. 953–976

    2010

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.