Science AI Journal
Mathematics · Research topic

Open research questions in Numerical methods for differential equations

36 unresolved questions extracted from the limitations and future-work sections of 437 Numerical methods for differential equations papers in our library. Each links back to the study that raised it.

What the literature leaves open

  • Further examples that combine the easy implementation of the hitherto under-explored GARK, multi-rate, and multi-rate infinitesimal methods illustrate the utility of pythOS as a wide-ranging tool for exploration of operator-splitting methods.

    pythOS: A Python library for solving IVPs by operator splitting · 2026 · DOI

  • The open problem suggested by the numerical results, which is beyond the scope of this paper, is the characterization of the opti- mal range or exact value of the coupling constant b that maximizes the system’s exponential decay efficiency. 123 Theoretical and numerical study of the exponential stability… Page 31 of 34 429 5 Conclusion and open questions In this work, we investigated the exponential stability of a system of Euler–Bernoulli beam equations coupled through velocities, with boundary damping applied to only one equation. To conclude this paper, we propose two open problems that merit further inves- tigation: 1. Stabilization of multidimensional coupled beam systems: A further important open problem is the extension of the current stability analysis to higher-dimensional systems.

    Theoretical and numerical study of the exponential stability of coupled Euler–Bernoulli beam equations · 2026 · DOI

  • It remains to be seen, however, whether this advan- tage comes at an acceptable cost: it is possible that, depending on the application considered, the adiabatic steps necessary to remain within a convex region in pa- rameter space throughout the evolution are so small that the method does not outperform a standard VQLS with barren plateaus after all. Any performance evaluation aimed at certifying some quantum advantage would re- quire at least twice as many qubits and real quantum hardware and was beyond the scope of this work.

    Variational-Adiabatic Quantum Solver for Systems of Linear Equations with Warm Starts · 2026 · DOI

  • Beyond the second Bautin bifurcation, the extent of the bistable regime is delimited by the loci of limit points of cycles (LPC) emanating from the Bautin points.

    ff-bifbox: A scalable, open-source toolbox for bifurcation analysis of nonlinear PDEs · 2026 · DOI

  • The energy-type bound in Theorem 9 for the fully discrete affine adsorption problem includes boundary integral terms involving inflow/outflow fluxes, but no analysis is provided for how these bounds behave for different boundary conditions or domains with complex geometries relevant to realistic nonlinear transport applications.

    A high-accuracy symplectic scheme for a nonlinear transport problem · 2026 · DOI

  • The constants K, KPF, and β₁ appearing in the error bounds (Theorems 5, 8, 10) are stated to be independent of mesh size h but their explicit dependence on problem parameters (diffusion coefficient D, velocity field u, adsorption parameters K₁, K₂) is not characterized, limiting practical error prediction for symplectic schemes in nonlinear transport problems.

    A high-accuracy symplectic scheme for a nonlinear transport problem · 2026 · DOI

  • The refactorization midpoint method (Equations 39-40) is only analyzed for the special case of affine isotherms; the performance and stability properties of this time discretization scheme when applied to the general nonlinear adsorption isotherm q(C) with arbitrary nonlinearity remain unexamined.

    A high-accuracy symplectic scheme for a nonlinear transport problem · 2026 · DOI

  • The error estimate in Theorem 10 for the fully discrete case depends on the third temporal derivative term (Cttt) with an (Δt)⁴ coefficient, but the paper does not specify conditions on the exact solution C that guarantee sufficient smoothness (H¹(0,T,H^(k+1)(Ω)) with bounded Cttt) for this estimate to be practically applicable to realistic adsorption models.

    A high-accuracy symplectic scheme for a nonlinear transport problem · 2026 · DOI

  • The symplectic scheme with affine adsorption isotherm q(C) = K₁ + K₂C has been analyzed theoretically in Theorems 8-10, but no numerical experiments are provided to validate the convergence rates or demonstrate practical performance compared to non-symplectic time discretization methods for nonlinear transport problems.

    A high-accuracy symplectic scheme for a nonlinear transport problem · 2026 · DOI

  • The paper uses Itô's formula and Itô-isometry to bound EX^o_t=0[II^i_s] in Step 2a, but does not investigate how the Jacobian-based estimates Jx w(u, x + X^o_ti + Ẽ^o_u) perform when w has non-smooth or near-singular behavior in certain regions of the state space, nor does it provide guidance on time step selection N to balance approximation error I^i_s and II^i_s terms in practice.

    Numerical Method for Nonlinear Kolmogorov PDEs via Sensitivity Analysis · 2026 · DOI

  • The proof of Theorem 2.9 relies on Lemma 6.2 to bound moments of the canonical process X^o and the auxiliary process X̃^o under the reference measure, but the extension of these bounds to high-dimensional settings (d >> 10) and their interaction with the BDG inequality constants is not analyzed, leaving scalability of the sensitivity-based numerical method for high-dimensional Kolmogorov PDEs unverified.

    Numerical Method for Nonlinear Kolmogorov PDEs via Sensitivity Analysis · 2026 · DOI

  • Theorem 2.9's proof establishes convergence rates of order 1/√M0, 1/√N, 1/√M1, and 1/√M2 for the numerical approximation of v0(t,x) and v1,(t,x) through Monte Carlo and time discretization, but the paper does not investigate how these rates degrade when the polynomial growth order α̃ of the function f and its derivatives becomes large (α̃ >> 3), nor does it provide empirical validation of the constant C0, C1, ... scaling with respect to problem parameters.

    Numerical Method for Nonlinear Kolmogorov PDEs via Sensitivity Analysis · 2026 · DOI

  • The paper extends Proposition 5.8 from [16] by relaxing the volatility-only setting (b = 0) to include drift and strengthening convergence from weak convergence to τp-topology for polynomially growing test functions. However, the specific convergence rates and stability properties under joint drift-volatility perturbations in the τp-topology have not been quantitatively characterized, particularly for uncertainty sets with ε approaching λmin(σo).

    Numerical Method for Nonlinear Kolmogorov PDEs via Sensitivity Analysis · 2026 · DOI

  • The analysis assumes that the nonlinear algebraic system at each time step (u[0] = u0 - (r/ε²)B(α)f(u[0])) can be solved exactly via Newton iteration, but the effect of inexact nonlinear solver convergence and iteration error accumulation on the global L2-error bound remains unanalyzed.

    On the Conjecture of Stability Preservation in Arbitrary-Order Adams-Bashforth-Type Integrators · 2026 · DOI

  • The choice of parameter α in the ABTI scheme does not affect the step size constraint according to the paper, but the impact of different α values on the error constant C in the L2-error bound C(τ^(q-1) + h^k) has not been characterized, leaving open how to optimize α for practical applications.

    On the Conjecture of Stability Preservation in Arbitrary-Order Adams-Bashforth-Type Integrators · 2026 · DOI

  • The parabolic CFL condition derived from the spectral radius of the amplification matrix is validated only for the heat equation with periodic boundary conditions; applicability to non-homogeneous boundary conditions or other parabolic PDEs with different spatial operators requires investigation.

    On the Conjecture of Stability Preservation in Arbitrary-Order Adams-Bashforth-Type Integrators · 2026 · DOI

  • The numerical experiments for fourth-order and higher ABTI schemes require high-precision arithmetic in MATLAB rather than standard machine precision; the paper does not investigate whether this precision limitation represents a fundamental computational barrier or merely a practical implementation issue for higher-order schemes in scientific computing.

    On the Conjecture of Stability Preservation in Arbitrary-Order Adams-Bashforth-Type Integrators · 2026 · DOI

  • The stability analysis for arbitrary-order Adams-Bashforth-type integrators (ABTI) has only been validated on low-dimensional problems (Allen-Cahn ODE and 1D heat equation); extension to high-dimensional complex regions with realistic mass and stiffness matrices from high-order finite element methods remains unexamined, as acknowledged by the authors' statement that 'in high-dimensional complex regions, the mass and stiffness matrices obtained from high-order finite element methods are relatively complicated.'

    On the Conjecture of Stability Preservation in Arbitrary-Order Adams-Bashforth-Type Integrators · 2026 · DOI

  • No comparison with other recent block hybrid methods beyond TSHBM (2017) and HBM (2023) is provided, limiting the scope of validation against contemporary approaches.

    Adams-Type Block Hybrid Method for Direct Solutions of Second-Order Differential Equations · 2026 · DOI

  • The paper lacks discussion of the method's behavior with varying step sizes in adaptive step-size implementations, despite the comparison method (Jator et al. 2023) using variable step-size mode.

    Adams-Type Block Hybrid Method for Direct Solutions of Second-Order Differential Equations · 2026 · DOI

  • The convergence analysis assumes that u(x, t) ∈ H²(0, L) for fixed t and can be decomposed into specific forms (2.22)-(2.23), but the paper does not discuss how restrictive these assumptions are or what happens when they are violated.

    Finite Element Method with Grünwald-Letnikov Type Approximation in Time for a Constant Time Delay Subdiffusion Equation · 2026 · DOI

  • Compared to ordinary differential equations (ODEs), the analysis of nonlinear reaction--diffusion PDEs with parametric uncertainties remains largely underexplored, due to the infinite-dimensional state space and the variety of solutions under different parameters.

    Certified Reachable Sets for Nonlinear Reaction--Diffusion Systems · 2026

  • The paper lacks discussion of computational complexity and scalability when applying the block multistep method to larger systems or over extended integration intervals.

    An Efficient Block Multistep Method for the Numerical Approximation of General Fourth-Order Ordinary Differential Equations · 2026 · DOI

  • The paper only tests the numerical scheme on two specific examples with particular parameter choices (τ = 1, p = 1/5, a = 0, b = 1 in Example 5.1), limiting the breadth of validation across different problem configurations.

    Finite Element Method with Grünwald-Letnikov Type Approximation in Time for a Constant Time Delay Subdiffusion Equation · 2026 · DOI

Most-cited papers in Numerical methods for differential equations

Most recent work

Find a gap in your own Numerical methods for differential equations sub-topic

This page shows what the Numerical methods for differential equations literature already flags as unresolved. To narrow it to your specific question, run the guided finder — it searches the gap library on demand and checks candidates against 250M+ OpenAlex works.

Open the Research Gap Finder →

Related topics in Mathematics

Cognitive and developmental aspects of mathematical skills
286 open questions
Mathematics Education and Pedagogy
125 open questions
Statistics Education and Methodologies
89 open questions
COVID-19 epidemiological studies
66 open questions
Advanced Causal Inference Techniques
56 open questions
Statistical Methods and Bayesian Inference
48 open questions
Mathematics Education and Programs
46 open questions
Fractional Differential Equations Solutions
46 open questions
36 open questions have been extracted from the limitations and future-work passages of 437 Numerical methods for differential equations papers in our library. Each one below links back to the study that raised it, so you can read the original claim in context.

Tools for your next paper

Gaps & Literature SearchFind open questions in any field — 120,000+ open gaps mined from our own library.Pre-CheckIs your paper ready? A Tier 1–5 acceptance probability in seconds.Journal FinderA ranked shortlist of target journals from a 17,500-venue index.Duplicate Publication CheckerCheck prior-publication & salami-slicing risk across 8 sources.Citation GeneratorFreeA DOI or title → APA, MLA, Vancouver, Chicago, BibTeX, RIS. No signup.Graphical Abstract MakerFreeTurn your findings into a colorblind-safe graphical abstract.

Compare the category — Honest roundups of the AI research tools, ours listed alongside the alternatives.

Command palette

Jump anywhere, run any action.