Related papers: p-Adic Stability In Linear Algebra
Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…
Nowadays, many strategies to solve polynomial systems use the computation of a Gr{\"o}bner basis for the graded reverse lexicographical ordering, followed by a change of ordering algorithm to obtain a Gr{\"o}bner basis for the…
In this work, we systematically investigate linear multi-step methods for differential equations with memory. In particular, we focus on the numerical stability for multi-step methods. According to this investigation, we give some…
A new criterion for A-stability of peer two-step methods is presented which is verifiable exactly in exact arithmetic by checking semi-definiteness of a certain test matrix. It depends on the existence of two positive definite weight…
Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…
Many modern datasets don't fit neatly into $n \times p$ matrices, but most techniques for measuring statistical stability expect rectangular data. We study methods for stability assessment on non-rectangular data, using statistical learning…
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a $p$-adic lifting technique combined with the use of block matrices with structured blocks. It achieves a sub-cubic…
In our recent work on iterative computation in hardware, we showed that arbitrary-precision solvers can perform more favorably than their traditional arithmetic equivalents when the latter's precisions are either under- or over-budgeted for…
We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…
In this paper, the convergence of the solutions for a discretized linear state-based static peridynamic system to the corresponding continuous solution is analytically proven. To obtain an implementable model, we further apply…
We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are…
In this paper, the stability of $\theta$-methods for delay differential equations is studied based on the test equation $y'(t)=-A y(t) + B y(t-\tau)$, where $\tau$ is a constant delay and $A$ is a positive definite matrix. It is mainly…
Investigation of the approximation properties, convergence, and stability of the ADER-DG method for solving an ODE system is carried out. The ADER-DG method is $A$- and $AN$-stable, $L$-stable, $B$- and $BN$-stable, and algebraically…
For nonautonomous linear difference equations in Banach spaces we show that a very general type of dichotomic behavior persists under small enough additive linear perturbations. By using a new approach, we obtain two general robustness…
Multiplicative and additive $D$-stability, diagonal stability, Schur $D$-stability, $H$-stability are classical concepts which arise in studying linear dynamical systems. We unify these types of stability, as well as many others, in one…
In the given paper we consider finite difference approximations to systems of polynomially-nonlinear partial differential equations whose coefficients are rational functions over rationals in the independent variables. The notion of strong…
We propose a modified condition of consistency on cubic lattices for some special classes of two-dimensional discrete equations and prove that the discrete nonlinear equations defined by determinants of matrices of orders N > 2 are…
Employing the ideas of non-linear preconditioning and testing of the classical proximal point method, we formalise common arguments in convergence rate and convergence proofs of optimisation methods to the verification of a simple…
This paper deals with stability in the numerical solution of the prominent Heston partial differential equation from mathematical finance. We study the well-known central second-order finite difference discretization, which leads to large…
A discretisation scheme for differential geometry is applied to the problem of constructing lattice actions, the naive and staggered action are thus derived. It is found that after specifying an ansatz for the space of fields, the…