pith. sign in

arxiv: 2604.20751 · v1 · submitted 2026-04-22 · 🧮 math.NA · cs.NA

Incremental SVD Compression for Nonlinear Oldroyd Equations with General Memory Kernels

Gang Chen , Yangwen Zhang , Dujin Zuo This is my paper

Pith reviewed 2026-05-09 23:29 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords memorykernelsmathcalsingularcompressionelementfinitegeneral
0
0 comments X

The pith

Incremental SVD compression reduces memory and computational cost for history terms in finite element discretizations of nonlinear Oldroyd problems with general kernels while retaining accuracy for small tolerances under low-rank assumptions.

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

Viscoelastic fluids like polymers or blood remember their past motion through memory kernels in the Oldroyd model. Solving these equations numerically with finite elements in space and Crank-Nicolson in time normally requires storing every previous velocity field to evaluate the memory integral. This quickly becomes expensive in both memory and time as the number of time steps grows. The authors compress the velocity history on the fly with an incremental singular value decomposition that keeps only a small number of basis vectors and updates them at each step. For kernels without singularities they prove that if the compression tolerance is small enough the extra error stays controlled and the overall accuracy matches the uncompressed scheme. They extend the idea to weakly singular kernels using convolution quadrature. Tests indicate the compressed solutions are nearly identical to the full ones while using far less memory and running faster.

Core claim

Under an approximate low-rank assumption of numerical rank r, the storage decreases to O((m+N)r), while the total history-evaluation work becomes O(mNr+rN^2). For nonsingular kernels, we derive a tolerance-dependent perturbation estimate showing that the baseline finite element accuracy is retained when the compression tolerance is sufficiently small.

Load-bearing premise

The velocity history matrix admits an approximate low-rank structure with numerical rank r much smaller than min(m,N); this assumption is required for both the complexity reduction and the perturbation error bound to be useful.

Figures

Figures reproduced from arXiv: 2604.20751 by Dujin Zuo, Gang Chen, Yangwen Zhang.

Figure 1
Figure 1. Figure 1: A comparison of wall time and memory costs between the two algorithms is conducted [PITH_FULL_IMAGE:figures/full_fig_p030_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: A comparison of wall time and memory costs between the two algorithms is conducted [PITH_FULL_IMAGE:figures/full_fig_p032_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Geometry description of the planar four to one contraction flow domain [PITH_FULL_IMAGE:figures/full_fig_p032_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Local views of mesh system of 4 : 1 contraction flow [PITH_FULL_IMAGE:figures/full_fig_p033_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Contour plots of the velocity component u1. The upper panel is obtained by the conven￾tional FEM and the lower panel by the compressed method. Natural directions for future work therefore include combining the present solution-history com￾pression with fast convolution quadrature or sum-of-exponentials acceleration, developing adaptive tolerance strategies, and extending the analysis and implementation to … view at source ↗
Figure 6
Figure 6. Figure 6: Contour plots of the velocity component u2. The upper panel is obtained by the conven￾tional FEM and the lower panel by the compressed method. [5] John R. Cannon, Richard E. Ewing, Yinnian He, and Yanping Lin. A modified nonlinear galerkin method for the viscoelastic fluid motion equations. International journal of engineer￾ing science, 37(13):1643–1662, 1999. [6] Gang Chen, Yangwen Zhang, and Dujin Zuo. A… view at source ↗
read the original abstract

We study mixed finite element/Crank--Nicolson discretizations of a nonlinear Oldroyd problem with general nonsingular and weakly singular memory kernels. Direct evaluation of the history term requires storing all previous velocity snapshots, which leads to $\mathcal{O}(mN)$ memory and $\mathcal{O}(mN^2)$ work over $N$ time steps, where $m$ denotes the number of spatial degrees of freedom. To reduce this burden, we compress the velocity history online by an incremental singular value decomposition and use the compressed representation in the discrete memory term. Under an approximate low-rank assumption of numerical rank $r$, the storage decreases to $\mathcal{O}((m+N)r)$, while the total history-evaluation work becomes $\mathcal{O}(mNr+rN^2)$. For nonsingular kernels, we derive a tolerance-dependent perturbation estimate showing that the baseline finite element accuracy is retained when the compression tolerance is sufficiently small. We also extend the approach to tempered weakly singular kernels via convolution quadrature. Numerical tests show near-indistinguishable solutions from the uncompressed scheme for the reported tolerances, together with substantial memory savings and reduced wall-clock time.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Axiom & Free-Parameter Ledger

2 free parameters · 1 axioms · 0 invented entities

The central efficiency and accuracy claims rest on an unproven but numerically supported low-rank assumption for the velocity history; no other free parameters or invented entities are introduced.

free parameters (2)
  • compression tolerance
    User-chosen parameter that controls the trade-off between accuracy and compression ratio; appears in the perturbation estimate.
  • numerical rank r
    Effective rank of the compressed history; chosen adaptively or by tolerance and directly determines the reported complexity savings.
axioms (1)
  • domain assumption Velocity history snapshots admit an approximate low-rank structure with numerical rank r ≪ min(m, N)
    Invoked to obtain both the reduced storage/work bounds and the tolerance-dependent error control for nonsingular kernels.

pith-pipeline@v0.9.0 · 5499 in / 1415 out tokens · 27889 ms · 2026-05-09T23:29:16.781507+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages

  1. [1]

    Mostafa Abbaszadeh and Mehdi Dehghan. Investigation of the oldroyd model as a generalized incompressible navier–stokes equation via the interpolating stabilized element free galerkin technique.Applied numerical mathematics, 150:274–294, 2020

    work page 2020

  2. [2]

    Long-time stability of finite element approxi- mations for parabolic equations with memory.Numer

    Walter Allegretto, Yanping Lin, and Aihui Zhou. Long-time stability of finite element approxi- mations for parabolic equations with memory.Numer. Methods Partial Differential Equations, 15(3):333–354, 1999

    work page 1999

  3. [3]

    Bikram Bir, Deepjyoti Goswami, and Amiya K. Pani. Backward euler method for the equations of motion arising in oldroyd model of order one with nonsmooth initial data.IMA journal of numerical analysis, 42(4):3529–3570, 2022

    work page 2022

  4. [4]

    Incremental singular value decomposition of uncertain data with missing val- ues

    Matthew Brand. Incremental singular value decomposition of uncertain data with missing val- ues. InCOMPUTER VISON - ECCV 2002, PT 1, volume 2350 ofLecture Notes in Computer Science, pages 707–720. Springer Berlin Heidelberg, Berlin, Heidelberg, 2002. 34 Incremental SVD Compression for Nonlinear Oldroyd Equations Figure 6: Contour plots of the velocity com...

    work page 2002

  5. [5]

    Cannon, Richard E

    John R. Cannon, Richard E. Ewing, Yinnian He, and Yanping Lin. A modified nonlinear galerkin method for the viscoelastic fluid motion equations.International journal of engineer- ing science, 37(13):1643–1662, 1999

    work page 1999

  6. [6]

    An incremental svd method for non-fickian flows in porous media: Addressing storage and computational challenges.arXiv.org, 2023

    Gang Chen, Yangwen Zhang, and Dujin Zuo. An incremental svd method for non-fickian flows in porous media: Addressing storage and computational challenges.arXiv.org, 2023

    work page 2023

  7. [7]

    Convolution quadrature time dis- cretization of fractional diffusion-wave equations.Mathematics of computation, 75(254):673– 696, 2006

    Eduardo Cuesta, Christian Lubich, and Cesar Palencia. Convolution quadrature time dis- cretization of fractional diffusion-wave equations.Mathematics of computation, 75(254):673– 696, 2006

    work page 2006

  8. [8]

    Hiba Fareed and John R. Singler. Error analysis of an incremental proper orthogonal decom- position algorithm for pde simulation data.Journal of computational and applied mathematics, 368:112525, 2020

    work page 2020

  9. [9]

    Singler, Yangwen Zhang, and Jiguang Shen

    Hiba Fareed, John R. Singler, Yangwen Zhang, and Jiguang Shen. Incremental proper or- thogonal decomposition for pde simulation data.Computers & mathematics with applications (1987), 75(6):1942–1960, 2018

    work page 1987

  10. [10]

    Giraud, J

    L. Giraud, J. Langou, and M. Rozloznik. The loss of orthogonality in the gram-schmidt orthogonalization process.Computers & mathematics with applications (1987), 50(7):1069– 1075, 2005

    work page 1987

  11. [11]

    Springer-Verlag, Berlin, 1986

    Vivette Girault and Pierre-Arnaud Raviart.Finite Element Methods for Navier–Stokes Equa- tions: Theory and Algorithms, volume 5 ofSpringer Series in Computational Mathematics. Springer-Verlag, Berlin, 1986. 35 Gang Chen, Yangwen Zhang, and Dujin Zuo

    work page 1986

  12. [12]

    Karniadakis

    Ling Guo, Fanhai Zeng, Ian Turner, Kevin Burrage, and George E.M. Karniadakis. Efficient multistep methods for tempered fractional calculus: Algorithms and simulations.SIAM journal on scientific computing, 41(4):A2510–A2535, 2019

    work page 2019

  13. [13]

    Crank–nicolson extrapolation and finite element method for the oldroyd fluid with the midpoint rule.Journal of computational and applied mathematics, 415:114453, 2022

    Yingwen Guo and Yinnian He. Crank–nicolson extrapolation and finite element method for the oldroyd fluid with the midpoint rule.Journal of computational and applied mathematics, 415:114453, 2022

    work page 2022

  14. [14]

    Error estimate of the fast l1 method for time- fractional subdiffusion equations.Applied mathematics letters, 133:108288, 2022

    Yuxiang Huang, Fanhai Zeng, and Ling Guo. Error estimate of the fast l1 method for time- fractional subdiffusion equations.Applied mathematics letters, 133:108288, 2022

    work page 2022

  15. [15]

    The long-time behavior of finite-element approximations of solutions to semilinear parabolic problems.SIAM journal on numerical analysis, 26(2):348–365, 1989

    Stig Larsson. The long-time behavior of finite-element approximations of solutions to semilinear parabolic problems.SIAM journal on numerical analysis, 26(2):348–365, 1989

    work page 1989

  16. [16]

    C. Lubich. Convolution quadrature and discretized operational calculus. i.Numerische Math- ematik, 52(2):129–145, 1988

    work page 1988

  17. [17]

    Oxberry, Tanya Kostova-Vassilevska, William Arrighi, and Kyle Chand

    Geoffrey M. Oxberry, Tanya Kostova-Vassilevska, William Arrighi, and Kyle Chand. Limited- memory adaptive snapshot selection for proper orthogonal decomposition.International jour- nal for numerical methods in engineering, 109(2):198–217, 2017

    work page 2017

  18. [18]

    Pani and Jin Yun Yuan

    Amiya K. Pani and Jin Yun Yuan. Semidiscrete finite element galerkin approximations to the equations of motion arising in the oldroyd model.IMA journal of numerical analysis, 25(4):750–782, 2005

    work page 2005

  19. [19]

    ADI finite element Galerkin methods for two-dimensional tempered fractional integro-differential equations.Cal- colo, 60(3):Paper No

    Wenlin Qiu, Graeme Fairweather, Xuehua Yang, and Haixiang Zhang. ADI finite element Galerkin methods for two-dimensional tempered fractional integro-differential equations.Cal- colo, 60(3):Paper No. 41, 34, 2023

    work page 2023

  20. [20]

    Fast and oblivious convolution quadrature.SIAM J

    Achim Sch¨ adle, Mar´ ıa L´ opez-Fern´ andez, and Christian Lubich. Fast and oblivious convolution quadrature.SIAM J. Sci. Comput., 28(2):421–438, 2006

    work page 2006

  21. [21]

    An answer to an open question in the incremental svd

    Yangwen Zhang. An answer to an open question in the incremental svd. 2022. 36

    work page 2022