Related papers: Real Equation Systems with Alternating Fixed-point…
Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…
The superelastic constitutive model implemented in the commercial finite element code ABAQUS is verified using the method of exact solutions (MES). An analytical solution for uniaxial strain is first developed under a set of simplifying…
The Bessel point process is a rigid point process on the positive real line and its conditional measure on a bounded interval $[0,R]$ is almost surely an orthogonal polynomial ensemble. In this article, we show that if $R$ tends to…
In this paper, we introduce the notion of relative $\mathcal{K}$-equi-stability (RKES) to characterize the uniformly continuous dependence of (weak) solutions on external disturbances for nonlinear parabolic PDE systems. Based on the RKES,…
Transition interface sampling (TIS) and replica exchange TIS (RETIS) are powerful methods for computing rates of rare events inaccessible to straightforward molecular dynamics (MD) simulations. Path reweighting extends their output,…
We establish robust exponential convergence for $rp$-Finite Element Methods (FEMs) applied to fourth order singularly perturbed boundary value problems, in a \emph{balanced norm} which is stronger than the usual energy norm associated with…
An inverse-free dynamical system is proposed to solve the generalized absolute value equation (GAVE) with a fixed time convergence, where the time of convergence is finite and is uniformly bounded for all initial points. Moreover, an…
There are two well known systems formalizing total recursion beyond primitive recursion (\textbf{PR}), system \textbf{T} by G\"odel and system \textbf{F} by Girard and Reynolds. system \textbf{T} defines recursion on typed objects and can…
Boundary element methods (BEM) reduce a partial differential equation in a domain to an integral equation on the domain's boundary. They are particularly attractive for solving problems on unbounded domains, but handling the dense matrices…
In the BCSS model of real number computations we prove a concrete and explicit semi-decidable language to be undecidable yet not reducible from (and thus strictly easier than) the real Halting Language. This solution to Post's Problem over…
It is sometimes desirable to produce for a nonlinear system of ODEs a new representation of simpler structural form, but it is well known that this goal may imply an increase in the dimension of the system. This is what happens if in this…
A finite transformation method is introduced. This method is equivalent to the $Z$ transform method to a certain extent but generalizes it. By applying the presented method to the Bessel functions, it is possible to solve related ordinary…
The system of tensor equations (TEs) has received much considerable attention in the recent literature. In this paper, we consider a class of generalized tensor equations (GTEs). An important difference between GTEs and TEs is that GTEs can…
The paper is concerned with the development of efficient and accurate solution procedures for the isogeometric boundary element method (BEM) when applied to problems that contain inclusions that have elastic properties different to the…
We present a new tool for verification of modal mu-calculus formulae for process specifications, based on symbolic parity games. It enhances an existing method, that first encodes the problem to a Parameterised Boolean Equation System…
A new operator formalism for the reduction of degrees of freedom in the evolution of discrete partial differential equations (PDE) via real space Renormalization Group is introduced, in which cell-overlapping is the key concept.…
Solving systems of ordinary differential equations (ODEs) is essential when it comes to understanding the behavior of dynamical systems. Yet, automated solving remains challenging, in particular for nonlinear systems. Computer algebra…
Answer-set programming (ASP) is a successful problem-solving approach in logic-based AI. In ASP, problems are represented as declarative logic programs, and solutions are identified through their answer sets. Equilibrium logic (EL) is a…
In intuitionistic mathematics, the Brouwer Continuity Theorem states that all total real functions are (uniformly) continuous on the unit interval. We study this theorem and related principles from the point of view of Reverse Mathematics…
A new approach to the solution of boundary value problems within the so-called fictitious domain methods philosophy is proposed which avoids well known shortcomings of other fictitious domain methods, including the need to generate…