SIAM J. Comput
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Planar Perfect Matching Counting is as Hard as Determinants
Announce Type: new Abstract: In the 1960s, Fisher, Kasteleyn and Temperley designed an ingenious algorithm for computing the partition function of the dimer model, or equivalently, for counting perfect matchings in edge-weighted planar graphs (Philos. Mag. 1961; J. Mathematical Phys. 1963). This FKT algorithm later became the foundation for Valiant's holographic algorithms (FOCS 2004; SIAM J. Comput. 2008), which motivated the study of counting problems under the Holant framework. Combined...
Sparse FEONet: A Low-Cost, Memory-Efficient Operator Network via Finite-Element Local Sparsity for Parametric PDEs
Announce Type: replace Abstract: In this paper, we study the finite element operator network (FEONet), an operator-learning method for parametric problems, originally introduced in J. Y. Lee, S. Ko, and Y. Hong, Finite Element Operator Network for Solving Elliptic-Type Parametric PDEs, SIAM J. Sci. Comput., 47(2), C501-C528, 2025. FEONet realizes the parameter-to-solution map on a finite element space and admits a training procedure that does not require training data, while exhibiting high...
High-Order Schemes for Hyperbolic Conservation Laws Using Young Measures
arXiv:2509.02107v2 Announce Type: replace Abstract: We develop high-order numerical schemes to solve random hyperbolic conservation laws using linear programming. The proposed schemes are high-order extensions of the existing first-order scheme introduced in [{\sc S. Chu, M. Herty, M. Luk\'a\v{c}ov\'a-Medvi{\softd}ov\'a, and Y. Zhou}, SIAM J. Sci. Comput., 48 (2026)], where a novel structure-preserving numerical method using a concept of generalized, measure-valued solutions to solve random...
Structure-Informed Bounds on the Kronecker Rank of Block-Structured Matrices
arXiv:2605.30908v1 Announce Type: new Abstract: We derive theoretical bounds on the Kronecker rank of block-structured matrices that possess both inner and outer structure. Building on the matrix-to-tensor and tensor-to-matrix framework of Kilmer and Saibaba ($\textit{SIAM J. Matrix Anal.
Variable-preconditioned transformed primal-dual method for generalized Wasserstein Gradient Flows
arXiv:2509.15385v3 Announce Type: replace Abstract: We propose a Variable-Preconditioned Transformed Primal-Dual (VPTPD) method for solving generalized Wasserstein gradient flows based on the structure-preserving JKO scheme. This is a nontrivial extension of the TPD method [Chen et al. incorporating proximal splitting techniques to address the challenges arising from the nonsmoothness of the objective function.