Open Source
Optimized linear multistep methods for stiff problems
arXiv cs.NA0 views
arXiv:2610.22685v1 Announce Type: new Abstract: We design and test several new optimized linear multistep methods for stiff problems. Each method is A-stable, implicit, and second-order accurate. We focus on achieving the smallest possible error constant while also ensuring that stiff modes are damped. We recover some known optimal L-stable three- and four-step methods, and provide new and improved five-step methods. We also develop new methods that are not L-stable but provide a prescribed rate of damping in the infinitely stiff limit. Variable-step-size formulae are also provided for some of the new methods. Numerical tests demonstrate that the improved error constants lead to improved accuracy.
Source:https://arxiv.org/abs/2610.22685PreviousAdverse Effects of V2V Adoption on Road SafetyNextGeometric multigrid preconditioners for unfitted discretisations of the de Rham complex
Related posts

Forecasting the U.S. Senate with Prediction Markets and Monte Carlo Simulations
0dev.to AI
VoiceStudio: open-source, fully-local ElevenLabs alternative
0Hacker News New
Show HN: X Mode – macOS-style window management for Omarchy
0Hacker News Show
Show HN: Orca Style Workspaces for Herdr
0Hacker News Show
Supermarket freezers across Europe hit by second suspected cyber-attack
0Hacker News
AWS FinOps Field Notes (2026-11-02): Eliminating Idle NAT Gateways & Unattached EIPs with Python
0dev.to AWS