Identifying Kronecker product factorizations

DOI10.1016/J.LAA.2026.07.016MaRDI QIDQ7397214zbMATH OpenFDO

Authors Yannis Voet, Leonardo De Novellis

Publication date 2026

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2026.07.016

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69) Computational methods for sparse matrices (65F50)

Cites work

• A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis
• A Heuristic for Direct Product Graph Decomposition
• A Kronecker product approximate preconditioner for SANs
• An efficient solver for space-time isogeometric Galerkin methods for parabolic problems
• Direct product primality testing of graphs is GI-hard
• Entangling power and local invariants of two-qubit gates
• Factoring cardinal product graphs in polynomial time
• Handbook of product graphs
• High-order spline upwind for space-time isogeometric analysis
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1253971 (Why is no real title available?)
• scientific article; zbMATH DE number 741107 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• scientific article; zbMATH DE number 5937963 (Why is no real title available?)
• Improved ParaDiag via low-rank updates and interpolation
• Isogeometric analysis. Toward integration of CAD and FEA
• Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
• Kronecker graphs: an approach to modeling networks
• Low rank tensor methods in Galerkin-based isogeometric analysis
• Mass lumping and outlier removal strategies for complex geometries in isogeometric analysis
• Partial tensor decomposition for decoupling isogeometric Galerkin discretizations
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Preconditioning and Iterative Solution of All-at-Once Systems for Evolutionary Partial Differential Equations
• Preconditioning techniques for generalized Sylvester matrix equations.
• Quantum computation and quantum information. 10th anniversary edition
• Testing product states, quantum Merlin-Arthur games and tensor optimization
• The Kronecker Product of Graphs
• The ubiquitous Kronecker product

This page was built for publication: Identifying Kronecker product factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397214)