Carbon-13 NMR Spectral Problems

1982 ◽  
Vol 10 (3) ◽  
pp. 123
Keyword(s):  
2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Yongxia Guo ◽  
Guangsheng Wei ◽  
Ruoxia Yao

Abstract In this paper, we are concerned with the inverse spectral problems for differential pencils defined on $[0,\pi ]$ [ 0 , π ] with an interior discontinuity. We prove that two potential functions are determined uniquely by one spectrum and a set of values of eigenfunctions at some interior point $b\in (0,\pi )$ b ∈ ( 0 , π ) in the situation of $b=\pi /2$ b = π / 2 and $b\neq \pi /2$ b ≠ π / 2 . For the latter, we need the knowledge of a part of the second spectrum.


Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1382
Author(s):  
Denis Spiridonov ◽  
Maria Vasilyeva ◽  
Aleksei Tyrylgin ◽  
Eric T. Chung

In this paper, we present a multiscale model reduction technique for unsaturated filtration problem in fractured porous media using an Online Generalized Multiscale finite element method. The flow problem in unsaturated soils is described by the Richards equation. To approximate fractures we use the Discrete Fracture Model (DFM). Complex geometric features of the computational domain requires the construction of a fine grid that explicitly resolves the heterogeneities such as fractures. This approach leads to systems with a large number of unknowns, which require large computational costs. In order to develop a more efficient numerical scheme, we propose a model reduction procedure based on the Generalized Multiscale Finite element method (GMsFEM). The GMsFEM allows solving such problems on a very coarse grid using basis functions that can capture heterogeneities. In the GMsFEM, there are offline and online stages. In the offline stage, we construct snapshot spaces and solve local spectral problems to obtain multiscale basis functions. These spectral problems are defined in the snapshot space in each local domain. To improve the accuracy of the method, we add online basis functions in the online stage. The construction of the online basis functions is based on the local residuals. The use of online bases will allow us to get a significant improvement in the accuracy of the method. We present results with different number of offline and online multisacle basis functions. We compare all results with reference solution. Our results show that the proposed method is able to achieve high accuracy with a small computational cost.


2021 ◽  
Vol 26 (2) ◽  
pp. 44
Author(s):  
Eric Chung ◽  
Hyea-Hyun Kim ◽  
Ming-Fai Lam ◽  
Lina Zhao

In this paper, we consider the balancing domain decomposition by constraints (BDDC) algorithm with adaptive coarse spaces for a class of stochastic elliptic problems. The key ingredient in the construction of the coarse space is the solutions of local spectral problems, which depend on the coefficient of the PDE. This poses a significant challenge for stochastic coefficients as it is computationally expensive to solve the local spectral problems for every realization of the coefficient. To tackle this computational burden, we propose a machine learning approach. Our method is based on the use of a deep neural network (DNN) to approximate the relation between the stochastic coefficients and the coarse spaces. For the input of the DNN, we apply the Karhunen–Loève expansion and use the first few dominant terms in the expansion. The output of the DNN is the resulting coarse space, which is then applied with the standard adaptive BDDC algorithm. We will present some numerical results with oscillatory and high contrast coefficients to show the efficiency and robustness of the proposed scheme.


Sign in / Sign up

Export Citation Format

Share Document