scholarly journals Joining Forces for Reconstruction Inverse Problems

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1687
Author(s):  
Irene Sciriha
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Graph Matching ◽  
Isomorphism Problem ◽  
Reconstruction Problem ◽  
Graph Invariants ◽  
Minimal Set ◽  
Disconnected Graphs ◽  
Polynomial Reconstruction ◽  
Spectral Inverse Problem

A spectral inverse problem concerns the reconstruction of parameters of a parent graph from prescribed spectral data of subgraphs. Also referred to as the P–NP Isomorphism Problem, Reconstruction or Exact Graph Matching, the aim is to seek sets of parameters to determine a graph uniquely. Other related inverse problems, including the Polynomial Reconstruction Problem (PRP), involve the recovery of graph invariants. The PRP seeks to extract the spectrum of a graph from the deck of cards each showing the spectrum of a vertex-deleted subgraph. We show how various algebraic methods join forces to reconstruct a graph or its invariants from a minimal set of restricted eigenvalue-eigenvector information of the parent graph or its subgraphs. We show how functions of the entries of eigenvectors of the adjacency matrix A of a graph can be retrieved from the spectrum of eigenvalues of A. We establish that there are two subclasses of disconnected graphs with each card of the deck showing a common eigenvalue. These could occur as possible counter examples to the positive solution of the PRP.

scholarly journals Graphs Having Most of Their Eigenvalues Shared by a Vertex Deleted Subgraph

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1663
Author(s):  
Alexander Farrugia
Keyword(s):  
Characteristic Polynomial ◽  
Simple Graph ◽  
Characteristic Polynomials ◽  
Reconstruction Problem ◽  
Vertex Set ◽  
Disconnected Graphs ◽  
Polynomial Reconstruction ◽  
Standing Problem

Let G be a simple graph and {1,2,…,n} be its vertex set. The polynomial reconstruction problem asks the question: given a deck P(G) containing the n characteristic polynomials of the vertex deleted subgraphs G−1, G−2, …, G−n of G, can ϕ(G,x), the characteristic polynomial of G, be reconstructed uniquely? To date, this long-standing problem has only been solved in the affirmative for some specific classes of graphs. We prove that if there exists a vertex v such that more than half of the eigenvalues of G are shared with those of G−v, then this fact is recognizable from P(G), which allows the reconstruction of ϕ(G,x). To accomplish this, we make use of determinants of certain walk matrices of G. Our main result is used, in particular, to prove that the reconstruction of the characteristic polynomial from P(G) is possible for a large subclass of disconnected graphs, strengthening a result by Sciriha and Formosa.

The inverse problem of recovering the coefficients of a differential equations on a graph

2020 ◽  
Vol 28 (5) ◽  
pp. 727-738
Author(s):  
Victor Sadovnichii ◽  
Yaudat Talgatovich Sultanaev ◽  
Azamat Akhtyamov
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Differential Equations ◽  
Boundary Value Problem ◽  
Boundary Conditions ◽  
Finite Number ◽  
Characteristic Equation ◽  
Arbitrary Number ◽  
New Class ◽  
Finite Set

AbstractWe consider a new class of inverse problems on the recovery of the coefficients of differential equations from a finite set of eigenvalues of a boundary value problem with unseparated boundary conditions. A finite number of eigenvalues is possible only for problems in which the roots of the characteristic equation are multiple. The article describes solutions to such a problem for equations of the second, third, and fourth orders on a graph with three, four, and five edges. The inverse problem with an arbitrary number of edges is solved similarly.

Variational-hemivariational inverse problem for electro-elastic unilateral frictional contact problem

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Othmane Baiz ◽  
Hicham Benaissa ◽  
Zakaria Faiz ◽  
Driss El Moutawakil
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Contact Problem ◽  
Existence And Uniqueness ◽  
Frictional Contact ◽  
Hemivariational Inequalities ◽  
Frictional Contact Problem ◽  
Uniqueness Of A Solution

AbstractIn the present paper, we study inverse problems for a class of nonlinear hemivariational inequalities. We prove the existence and uniqueness of a solution to inverse problems. Finally, we introduce an inverse problem for an electro-elastic frictional contact problem to illustrate our results.

scholarly journals Adjoint Numerical Method for a Multiphysical Inverse Problem of Two-Phase Well Testing in Petroleum Reservoirs

2021 ◽  
Vol 2090 (1) ◽  
pp. 012139
Author(s):  
OA Shishkina ◽  
I M Indrupskiy
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Objective Function ◽  
Petroleum Reservoirs ◽  
Forward Problem ◽  
Adjoint Equations ◽  
Well Testing ◽  
Adjoint Methods ◽  
Two Phase ◽  
Gradient Calculation

Abstract Inverse problem solution is an integral part of data interpretation for well testing in petroleum reservoirs. In case of two-phase well tests with water injection, forward problem is based on the multiphase flow model in porous media and solved numerically. The inverse problem is based on a misfit or likelihood objective function. Adjoint methods have proved robust and efficient for gradient calculation of the objective function in this type of problems. However, if time-lapse electrical resistivity measurements during the well test are included in the objective function, both the forward and inverse problems become multiphysical, and straightforward application of the adjoint method is problematic. In this paper we present a novel adjoint algorithm for the inverse problems considered. It takes into account the structure of cross dependencies between flow and electrical equations and variables, as well as specifics of the equations (mixed parabolic-hyperbolic for flow and elliptic for electricity), numerical discretizations and grids, and measurements in the inverse problem. Decomposition is proposed for the adjoint problem which makes possible step-wise solution of the electric adjoint equations, like in the forward problem, after which a cross-term is computed and added to the right-hand side of the flow adjoint equations at this timestep. The overall procedure provides accurate gradient calculation for the multiphysical objective function while preserving robustness and efficiency of the adjoint methods. Example cases of the adjoint gradient calculation are presented and compared to straightforward difference-based gradient calculation in terms of accuracy and efficiency.

Compact discrepancy and chi-squared principles for over-determined inverse problems

2017 ◽  
Vol 25 (3) ◽  
Author(s):  
Maxim Pisarenco ◽  
Irwan D. Setija
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Regularization Parameter ◽  
Discrepancy Principle ◽  
Chi Squared

AbstractWe discuss and analyze the classical discrepancy principle and the recently proposed and closely related chi-squared principle for selecting the regularization parameter of an inverse problem. Some properties that deteriorate the performance of these methods for over-determined inverse problems are highlighted. We propose a so-called

scholarly journals Bayesian statistics of non-linear inverse problems: example of the magnetotelluric 1-D inverse problem

1994 ◽  
Vol 119 (2) ◽  
pp. 353-368 ◽  
Author(s):  
Pascal Tarits ◽  
Virginie Jouanne ◽  
Michel Menvielle ◽  
Michel Roussignol
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Bayesian Statistics ◽  
Linear Inverse Problems ◽  
Non Linear

Regularization by Denoising for simultaneous source separation

Geophysics ◽  
2021 ◽  
pp. 1-56
Author(s):  
Breno Bahia ◽  
Rongzhi Lin ◽  
Mauricio Sacchi
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Data Processing ◽  
Spectrum Analysis ◽  
Numerical Experiments ◽  
Source Separation ◽  
Singular Spectrum Analysis ◽  
Source Data ◽  
Blended Data ◽  
Simultaneous Source

Denoisers can help solve inverse problems via a recently proposed framework known as regularization by denoising (RED). The RED approach defines the regularization term of the inverse problem via explicit denoising engines. Simultaneous source separation techniques, being themselves a combination of inversion and denoising methods, provide a formidable field to explore RED. We investigate the applicability of RED to simultaneous-source data processing and introduce a deblending algorithm named REDeblending (RDB). The formulation permits developing deblending algorithms where the user can select any denoising engine that satisfies RED conditions. Two popular denoisers are tested, but the method is not limited to them: frequency-wavenumber thresholding and singular spectrum analysis. We offer numerical blended data examples to showcase the performance of RDB via numerical experiments.

On Solutions of Inverse Problem for Hermitian Generalized Hamiltonian Matrices

2013 ◽  
Vol 860-863 ◽  
pp. 2727-2731
Author(s):  
Kai Fu Liang ◽  
Ming Jun Li ◽  
Ze Lin Zhu
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Design Automation ◽  
Sufficient Conditions ◽  
Matrix Equations ◽  
Complex Matrix ◽  
Linear Quadratic ◽  
Real Representation ◽  
The Matrix ◽  
Necessary And Sufficient

Hamiltonian matrices have many applications to design automation and autocontrol, in particular in the linear-quadratic autocontrol problem. This paper studies the inverse problems of generalized Hamiltonian matrices for matrix equations. By real representation of complex matrix, we give the necessary and sufficient conditions for the existence of a Hermitian generalized Hamiltonian solutions to the matrix equations, and then derive the representation of the general solutions.

Sign in / Sign up

Export Citation Format

Share Document