相关论文: An algorithm for composition of inverse problems w…

Some iterative techniques are defined to solve reversible inverse problems and a common formulation is explained. Numerical improvements are suggested and tests validate the methods.

In a recent paper, Lenz and Moody (arXiv:1111.3617) presented a method for constructing families of real solutions to the inverse problem for a given pure point diffraction measure. Applying their technique and discussing some possible…

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

We give an algorithm to compute the series expansion for the inverse of a given function. The algorithm is extremely easy to implement and gives the first $N$ terms of the series. We show several examples of its application in calculating…

We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…

An inverse problem is considered for an inhomogeneous Schr\"odinger equation. Assuming that the potential vanishes outside a finite interval and satisfies some other technical assumptions, one proves the uniqueness of the recovery of this…

We describe a simple way of constructing exponentially growing solutions of the second order systems with the Laplacian as the principal term.

Two distinct algorithms are presented to extract (schemata of) resolution proofs from closed tableaux for propositional schemata. The first one handles the most efficient version of the tableau calculus but generates very complex…

A complete solution for an inverse problem needs five main steps: choice of basis functions for discretization, determination of the order of the model, estimation of the hyperparameters, estimation of the solution, and finally,…

We discuss the possibility to learn a data-driven explicit model correction for inverse problems and whether such a model correction can be used within a variational framework to obtain regularised reconstructions. This paper discusses the…

In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on…

Inverse optimal control problem emerges in different practical applications, where the goal is to design a cost function in order to approximate given optimal strategies of an expert. Typical application is in robotics for generation of…

We propose abstract compilation for precise static type analysis of object-oriented languages based on coinductive logic programming. Source code is translated to a logic program, then type-checking and inference problems amount to queries…

We discuss a construction that gives counterexamples to various questions of unique determination of convex bodies.

In this paper we introduce the functional framework and the necessary conditions for the well-posedness of an inverse problem arising in the mathematical modeling of disease transmission. The direct problem is given by an initial boundary…

We consider a general statistical linear inverse problem, where the solution is represented via a known (possibly overcomplete) dictionary that allows its sparse representation. We propose two different approaches. A model selection…

MacMahon's definition of self-inverse composition is extended to $n$-colour self-inverse composition. This introduces four new sequences which satisfy the same recurrence relation with different initial conditions like the famous Fibonacci…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

We consider a neural network architecture designed to solve inverse problems where the degradation operator is linear and known. This architecture is constructed by unrolling a forward-backward algorithm derived from the minimization of an…

In our article we consider some algebraical methods which may be useful in some inverse spectral problems. The reconstraction of the matrix from its minors is considered.