Study identifies numerical signs of blow-up in hydrodynamic equations.
problem Determining if numerical results of blow-up are genuine or artifacts.
method Geometrically consistent spatiotemporal discretization of complexified Euler equations.
result Identification of a signature based on supremum norm growth rates of vorticity.
Study disproves a generalized numerical criterion for certain pairs.
problem Generalized numerical criterion for pairs
method Provided counterexamples
result Negative answer to the generalized numerical criterion problem
Study shows how numerical discretization affects reconstructions and parameter distributions in nano metrology.
problem Impact of numerical discretization on parameter reconstructions and model parameter distributions.
method Bayesian target vector optimization, finite element model, Gaussian process, stochastic machine learning surrogate models, Markov chain Monte Carlo sampler.
result Numerical discretization parameters impact the accuracy and distribution of reconstructed model parameters.
This study improves numeric data generation using constrained WGAN structures.
problem Overfitting and ill-conditioning in numeric data generation with GANs.
method Designs and evaluates constrained network structures (isomorphic, mirror, self-symmetric) in WGANs for numeric data generation.
result Constrained structures significantly improve numeric data generation in 17/20 experiments.
Study numerical invariants under retraction maps between topological spaces.
problem Understand behavior of invariants like cohomological dimensions under retractions.
method Introduced a notion of retraction and studied several numerical invariants.
result Proved inequalities between invariants hold under retractions.
Investigates numerical issues in GP interpolation parameter estimation.
problem Numerical issues in maximum likelihood parameter estimation for Gaussian process interpolation.
method Investigates and proposes strategies to improve open-source software implementations.
result Improves reliability and reproducibility of studies relying on GP implementations.
We derive high-order compact finite difference schemes for option pricing in stochastic volatility models on non-uniform grids. The schemes are fourth-order accurate in space and second-order accurate in time for vanishing correlation. In our numerical study we obtain high-order numerical convergence also for non-zero …
Study evaluates and compares numerical differentiation methods on three case studies.
problem Evaluating and comparing numerical differentiation methods for efficiency.
method Forward, Backward, and Centered Finite-Difference methods applied at two levels of precision.
result Different methods perform differently across case studies, with varying levels of computational cost and accuracy.
Study uses neural networks to solve complex equations efficiently.
problem Solving parametric partial differential equations.
method Machine learning and deep neural networks.
result Performance of the model is independent of parameter space dimension.
Study efficient numerical methods for American basket options.
problem Valuation of American basket options.
method Partial differential complementarity problems (PDCPs) and efficient discretization.
result Approximations of American basket options are close and converge favourably.
Study compares 5 ODE solvers on 3 case studies, finding varying accuracy.
problem Comparing estimation accuracy of 5 ODE solvers on 3 case studies.
method Used 5 different numerical ODE solvers (Euler's, Heun's, Midpoint, Runge-Kutta 4th order, ODE45) on 3 case studies and compared their results.
result Different solvers have varying accuracy depending on the case study.
We provide notions of numerical effectiveness and numerical flatness for Higgs vector bundles on compact Kähler manifolds in terms of fibre metrics. We prove several properties of bundles satisfying such conditions and in particular we show that numerically flat Higgs bundles have vanishing Chern classes, and that they…
Study validates Libor model for insurance benefits calculation.
problem Valuation of long-term insurance guarantees.
method Mean-field Libor market model, numerical ALM, aggregated life insurance data.
result Derives estimators for future discretionary benefits.
Study proposes Local Linear Encoding for better feature discretization.
problem Improving feature discretization for numeric data.
method Theoretical analysis and Local Linear Encoding (LLE) method.
result LLE outperforms conventional methods with fewer parameters.
Study investigates how errors in reinsurance parameters degrade optimal solutions.
problem Effectiveness of optimal reinsurance solutions degraded by errors in parameters and models.
method Asymptotic and numerical studies, including Value at Risk criteria and Bayesian integration.
result Rate of degradation often O ( 1 / n ) O(1/n) O ( 1/ n ) , but can be O ( 1 / n ) O(1/\sqrt{n}) O ( 1/ n ) for Value at Risk. In this paper, we study numerically flat holomorphic vector bundles over a compact non-Kähler manifold ( X , ω ) (X, ω) ( X , ω ) with the Hermitian metric ω ω ω satisfying the Gauduchon and Astheno-Kähler conditions. We prove that numerically flatness is equivalent to numerically effectiveness with vanishing first Chern number, semistabl…
Groups of matrices with integer-like entries are studied.
problem Characterizing groups of matrices with algebraic integer entries.
method Analyzing traces and subgroups of matrices in number fields.
result Irreducible or completely reducible subgroups with algebraic integer traces are numerical.
Despite the importance of handwritten numeral classification, a robust and effective method for a widely used language like Arabic is still due. This study focuses to overcome two major limitations of existing works: data diversity and effective learning method. Hence, the existing Arabic numeral datasets have been mer…
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make use of the geometric formulas for our numerical scheme and its analysis of genera…
Study validates numerical method for singular FBSDEs convergence.
problem Solving singular FBSDEs and associated PDEs.
method Particles approximation for transport operator and tree approximation for diffusion operator.
result Convergence rate of numerical method proved under reasonable conditions.
Paper uses deep learning to solve PDEs without supervision.
problem Solving elliptic PDEs without labeled data.
method Uses deep neural networks and least-squares functionals.
result Demonstrates effectiveness on 1D second-order elliptic PDEs.
Introduces numerical Gaussian process Kalman filtering for infinite-dimensional systems.
problem Kalman filtering on infinite-dimensional systems.
method Embedding numerical Gaussian processes into Kalman filter equations.
result Ability to perform Kalman filtering on infinite-dimensional systems using Gaussian processes.
Deep learning method improves numerical approximation of FBSDEs with jumps.
problem Improving numerical solutions for FBSDEs with jumps.
method Deep learning-based approach for decoupled FBSDEs with jumps.
result A priori and a posteriori error estimates for finite and infinite activity cases.
Numerical study confirms Brennan's conjecture for a counterexample to Thurston's K = 2 K=2 K = 2 conjecture.
problem Thurston's K = 2 K=2 K = 2 conjecture and Brennan's conjecture in planar domains. method Numerical analysis of a specific counterexample to Thurston's conjecture.
result The counterexample does not contradict Brennan's conjecture.
Study numerical invariants for groups, computing for cyclic groups and surfaces.
problem Numerical invariants for groups and their computation.
method Computational and theoretical analysis of groups, including finite cyclic groups and nonorientable surfaces.
result Formula for the numerical invariant of free products of groups.
Study shows different behaviors of noncompact hypersurfaces under mean curvature flow.
problem Analyzing stability of noncompact hypersurfaces with curvature blowup.
method Numerical overlap method to construct global solutions.
result Existence of near and far classes of initial data leading to distinct behaviors.
New method models dewetting of anisotropic particles using numerical techniques.
problem Modeling dewetting dynamics of particles with varying surface energies.
method Level set numerical approach with convolution kernels to handle anisotropic interfacial energies.
result Validated numerical scheme supports merging and splitting of interfaces.
Study numerically flat foliations on Kähler manifolds, proving new splitting theorems.
problem Understanding foliations with numerically flat tangent bundles on Kähler manifolds.
method Analyzing the structure of foliations on compact Kähler manifolds, extending earlier results.
result Smooth foliations with numerically flat tangent bundles induce a decomposition of the ambient manifold's tangent bundle.
Study numerical methods for singular FBSDEs with degenerate forward component.
problem Numerical approximation of singular fully coupled FBSDEs with degenerate forward component and non-smooth terminal condition.
method Splitting approach to treat diffusion and transport parts separately.
result The splitting method converges with rate 1/2 under structural condition.
Study on Wasserstein distance for numerical approximations of stochastic differential equations.
problem Estimating the Wasserstein distance between stochastic differential equation distributions and their numerical approximations.
method Unified framework for analyzing different integrators and a novel splitting method for underdamped Langevin dynamics.
result A novel splitting method for underdamped Langevin dynamics with optimal complexity.
This paper deals with the numerical approximation of American-style option values governed by partial differential complementarity problems. For a variety of one- and two-asset American options we investigate by ample numerical experiments the temporal convergence behaviour of three modern splitting methods: the explic…
We use analytical and numerical methods to investigate the equations for cohomogeneity one shrinking gradient Ricci solitons. We show the existence of a winding number for this system around the subvariety of phase space corresponding to Einstein solutions and obtain some estimates for it. We prove a non-existence resu…
A new framework improves tensor completion accuracy by considering numerical priors.
problem Tensor completion accuracy loss due to ignoring numerical priors.
method Generalized CP Decomposition Tensor Completion (GCDTC) framework incorporating numerical priors.
result GCDTC framework outperforms state-of-the-arts in non-negative tensor completion.
Study develops numerical schemes for non-Markovian volatility models with memory.
problem Existence and uniqueness of strong solutions for non-Markovian SDEs.
method Functional quantization scheme based on Lamperti transformation.
result Theoretical foundation for numerical schemes applied to specific models.
We present a numerical implementation of the geodesic ray transform and its inversion over functions and solenoidal vector fields on two-dimensional Riemannian manifolds. For each problem, inversion formulas previously derived in \cite{Pestov2004,Krishnan2010} are implemented in the case of simple and some non-simple m…
Two-layer networks struggle with high frequencies due to numerical and computational limitations.
problem High frequency approximation and learning in shallow networks.
method Mathematical and computational analysis focusing on numerical error, computational cost, and stability.
result Explicit answers to fundamental computational issues in shallow networks' high frequency handling.
Deep neural networks struggle with numerical instability during training.
problem Numerical instability in gradient descent training of deep neural networks.
method Analysis of floating-point arithmetic and gradient descent in ReLU neural networks.
result It is highly unlikely for ReLU networks to maintain a superlinear number of affine pieces during training.
This study connects Gaussian processes and RKHS, bridging two machine learning communities.
problem Understanding the relationship between Gaussian processes and RKHS.
method Examining connections and equivalences in regression, interpolation, and other topics.
result Established the equivalence between Gaussian Hilbert space and RKHS.
Better neural arithmetic logic units improve cell counting model generalization.
problem Neural networks struggle with high cell counts outside training data range.
method Introduced Neural Arithmetic Logic Units (NALU) for arithmetic operations in existing architectures.
result Improved cell counting accuracy for higher numeric ranges with better generalization.
Study discretizes Dirac and port-Hamiltonian systems using manifolds.
problem Discretization of Dirac and port-Hamiltonian systems.
method Retraction and discretization maps on manifolds for Dirac structures, applied to port-Hamiltonian systems.
result Numerical integrators for port-Hamiltonian systems derived from discretization techniques.
Study wormholes in Einstein-Yang-Mills theory with a phantom field.
problem Existence of wormholes in Einstein-Yang-Mills theory with a phantom scalar field.
method Rigorous mathematical proof and numerical analysis of wormhole solutions.
result Existence of an infinite sequence of symmetric wormhole solutions.
NGRC shows numerical instabilities with short lags and high-degree polynomials.
problem Numerical instabilities in NGRC feature matrix.
method Combining numerical linear algebra and dynamical systems theory, we study feature matrix conditioning. We evaluate different numerical algorithms for solving the regularized least-squares problem.
result SVD-based training achieves accurate forecasts without regularization, preferable for short lags and high-degree polynomials.
Study methods to recover unknown processes in PDEs from data.
problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.
Study on CVA in volatility models, including rough volatility.
problem Calculating CVA in fractional and rough volatility models.
method General representation formula, specialized for volatility models, numerical and theoretical error analysis.
result Roughness influences the claim's price, and provides accurate approximations.
We simplify SVI volatility smile constraints for three sub-SVIs without numerical methods.
problem No arbitrage constraints for SVI volatility smiles.
method Explicit domain derivation for sub-SVIs without numerical procedures.
result Explicit no arbitrage domains for Symmetric SVI, Vanishing Upward/Downward SVI, and SSVI.
The memory capacity of linear echo state networks is accurately calculated using new numerical methods.
problem Numerical evaluations of memory capacity in recurrent neural networks often contradict theoretical bounds.
method Developed robust numerical approaches exploiting MC neutrality with respect to the input mask matrix.
result Memory curves fully agree with theory when using the proposed methods.
Improved MLMC method for robust and efficient probability and density estimation.
problem Stability and poor complexity of MLMC for low-regularity functionals.
method Numerical smoothing combined with MLMC for deterministic quadrature methods.
result Significant improvement in strong convergence and robustness of MLMC method.
We consider rate swaps which pay a fixed rate against a floating rate in presence of bid-ask spread costs. Even for simple models of bid-ask spread costs, there is no explicit strategy optimizing an expected function of the hedging error. We here propose an efficient algorithm based on the stochastic gradient method to…