三维电阻抗成像的体积元方法的数值模拟和分析

电阻抗成像是一类椭圆方程反问题,本文在三维区域上对其进行数值模拟和分析.对于椭圆方程Neumann边值正问题,本文提出了四面体单元上的一类对称体积元格式,并证明了格式的半正定性及解的存在性;引入单元形状矩阵的概念,简化了系数矩阵的计算;提出了对电阻率进行拼接逼近的方法来降低反问题求解规模,使之与正问题的求解规模相匹配;导出了误差泛函的Jacobi矩阵的计算公式,利用体积元格式的对称性和特殊的电流基向量,将每次迭代中需要求解的正问题的个数降到最低.一系列数值实验的结果验证了数学模型的可靠性和算法的可行性.本文所提出的这些方法,已成功应用于三维电阻抗成像的实际数值模拟.     

Reconstruction of biologic tissue conductivity from noisy magnetic field by integral equation method

Magnetic resonance electrical impedance tomography (MREIT) is a new technique to recover the conductivity of biologic tissue from the induced magnetic flux density. This paper proposes an inversion scheme for recovering the conductivity from one component of the magnetic field based on the nonlinear integral equation method. To apply magnetic fields corresponding to two incoherent injected currents, an alternative iteration scheme is proposed to update the conductivity. For each magnetic field, the regularizing technique on the finite dimensional space is applied to solve an ill-posed linear system. Compared with the well-developed harmonic B_z method, the advantage of this inversion scheme is its stability, since no differential operation is required on the noisy magnetic field. Numerical implementations are given to show the convergence of the iteration and its validity for noisy input data.     

Numerical method for solving a two-dimensional electrical impedance tomography problem in the case of measurements on part of the outer boundary

The two-dimensional electrical impedance tomography problem is considered in the case of a piecewise constant electrical conductivity. The task is to determine the unknown boundary separating the regions with different conductivity values, which are known. Input information is the electric field measured on a portion of the outer boundary of the domain. A numerical method for solving the problem is proposed, and numerical results are presented.     

An Inverse Problem of Calderón Type with Partial Data

A generalized variant of the Calderón problem from electrical impedance tomography with partial data for anisotropic Lipschitz conductivities is considered in an arbitrary space dimension n ≥ 2. The following two results are shown: (i) The selfadjoint Dirichlet operator associated with an elliptic differential expression on a bounded Lipschitz domain is determined uniquely up to unitary equivalence by the knowledge of the Dirichlet-to-Neumann map on an open subset of the boundary, and (ii) the Dirichlet operator can be reconstructed from the residuals of the Dirichlet-to-Neumann map on this subset.     

Generalized skew‐Hermitian triangular splitting iteration methods for saddle‐point linear systems

A generalized skew‐Hermitian triangular splitting iteration method is presented for solving non‐Hermitian linear systems with strong skew‐Hermitian parts. We study the convergence of the generalized skew‐Hermitian triangular splitting iteration methods for non‐Hermitian positive definite linear systems, as well as spectrum distribution of the preconditioned matrix with respect to the preconditioner induced from the generalized skew‐Hermitian triangular splitting. Then the generalized skew‐Hermitian triangular splitting iteration method is applied to non‐Hermitian positive semidefinite saddle‐point linear systems, and we prove its convergence under suitable restrictions on the iteration parameters. By specially choosing the values of the iteration parameters, we obtain a few of the existing iteration methods in the literature. Numerical results show that the generalized skew‐Hermitian triangular splitting iteration methods are effective for solving non‐Hermitian saddle‐point linear systems with strong skew‐Hermitian parts. Copyright © 2013 John Wiley & Sons, Ltd.     

Comparison of numerical algorithms for quasilinear elliptical equations with a large Lipschitz constant

We consider difference schemes that find generalized solutions of quasilinear elliptical equations with a monotone nonlinearity and a large Lipschitz constant. Possible realizations of these difference schemes are considered. It is shown that application of traditional methods may lead to divergence of the iteration process if the Lipschitz constant is sufficiently large. Efficient solution methods are proposed for such problems. Numerical results reported are consistent with the theoretical rate of convergence bounds of the difference schemes.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 55, pp. 44–51, 1985.     

On HSS and AHSS iteration methods for nonsymmetric positive definite Toeplitz systems

Two iteration methods are proposed to solve real nonsymmetric positive definite Toeplitz systems of linear equations. These methods are based on Hermitian and skew-Hermitian splitting (HSS) and accelerated Hermitian and skew-Hermitian splitting (AHSS). By constructing an orthogonal matrix and using a similarity transformation, the real Toeplitz linear system is transformed into a generalized saddle point problem. Then the structured HSS and the structured AHSS iteration methods are established by applying the HSS and the AHSS iteration methods to the generalized saddle point problem. We discuss efficient implementations and demonstrate that the structured HSS and the structured AHSS iteration methods have better behavior than the HSS iteration method in terms of both computational complexity and convergence speed. Moreover, the structured AHSS iteration method outperforms the HSS and the structured HSS iteration methods. The structured AHSS iteration method also converges unconditionally to the unique solution of the Toeplitz linear system. In addition, an upper bound for the contraction factor of the structured AHSS iteration method is derived. Numerical experiments are used to illustrate the effectiveness of the structured AHSS iteration method.     

A class of Uzawa-SOR methods for saddle point problems

In this paper, we consider a class of Uzawa-SOR methods for saddle point problems, and prove the convergence of the proposed methods. We solve a lower triangular system per iteration in the proposed methods, instead of solving a linear equation Az=b. Actually, the new methods can be considered as an inexact iteration method with the Uzawa as the outer iteration and the SOR as the inner iteration. Although the proposed methods cannot achieve the same convergence rate as the GSOR methods proposed by Bai et al. [Z.-Z. Bai, B.N. Parlett, Z.-Q. Wang, On generalized successive overrelaxation methods for augmented linear systems, Numer. Math. 102 (2005) 1-38], but our proposed methods have less workloads per iteration step. Experimental results show that our proposed methods are feasible and effective.     

不等式约束优化一个基于滤子思想的广义梯度投影算法

讨论非线性不等式约束优化问题, 借鉴于滤子算法思想,提出了一个新型广义梯度投影算法.该方法既不使用罚函数又无真正意义下的滤子.每次迭代通过一个简单的显式广义投影法产生搜索方向,步长由目标函数值或者约束违反度函数值充分下降的Armijo型线搜索产生.算法的主要特点是: 不需要迭代序列的有界性假设;不需要传统滤子算法所必需的可行恢复阶段;使用了ε积极约束集减小计算量.在合适的假设条件下算法具有全局收敛性, 最后对算法进行了初步的数值实验.     

Iterative method for solving a three-dimensional electrical impedance tomography problem in the case of piecewise constant conductivity and one measurement on the boundary

The problem of electrical impedance tomography in a bounded three-dimensional domain with a piecewise constant electrical conductivity is considered. The boundary of the inhomogeneity is assumed to be unknown. The inverse problem is to determine the surface that is the boundary of the inhomogeneity from given measurements of the potential and its normal derivative on the outer boundary of the domain. An iterative method for solving the inverse problem is proposed, and numerical results are presented.     

On the Error Estimate of the Harmonic B_z Algorithm in MREIT from Noisy Magnetic Flux Field

Magnetic resonance electrical impedance tomography(MREIT, for short) is a new medical imaging technique developed recently to visualize the cross-section conductivity of biologic tissues. A new MREIT image reconstruction method called harmonic Bz algorithm was proposed in 2002 with the measurement of Bz that is a single component of an induced magnetic flux density subject to an injection current. The key idea is to solve a nonlinear integral equation by some iteration process. This paper deals with the convergence analysis as well as the error estimate for noisy input data Bz, which is the practical situation for MREIT. By analyzing the iteration process containing the Laplacian operation on the input magnetic field rigorously, the authors give the error estimate for the iterative solution in terms of the noisy level δ and the regularizing scheme for determiningΔBz approximately from the noisy input data. The regularizing scheme for computing the Laplacian from noisy input data is proposed with error analysis. Our results provide both the theoretical basis and the implementable scheme for evaluating the reconstruction accuracy using harmonic Bz algorithm with practical measurement data containing noise.     

Identification of an inclusion in multifrequency electric impedance tomography

The multifrequency electrical impedance tomography is considered to image a conductivity inclusion inside a homogeneous background medium by injecting one current. An original spectral decomposition of the solution of the forward conductivity problem is used to retrieve the Cauchy data corresponding to the extreme case of perfect conductor. Using results based on the unique continuation, we then prove the uniqueness of multifrequency electrical impedance tomography and obtain rigorous stability estimates. Our results in this paper are quite surprising in inverse conductivity problem since in general infinitely many input currents are needed to obtain the uniqueness in the determination of the conductivity.     

Penalized Orthogonal Iteration for Sparse Estimation of Generalized Eigenvalue Problem

We propose a new algorithm for sparse estimation of eigenvectors in generalized eigenvalue problems (GEPs). The GEP arises in a number of modern data-analytic situations and statistical methods, including principal component analysis (PCA), multiclass linear discriminant analysis (LDA), canonical correlation analysis (CCA), sufficient dimension reduction (SDR), and invariant co-ordinate selection. We propose to modify the standard generalized orthogonal iteration with a sparsity-inducing penalty for the eigenvectors. To achieve this goal, we generalize the equation-solving step of orthogonal iteration to a penalized convex optimization problem. The resulting algorithm, called penalized orthogonal iteration, provides accurate estimation of the true eigenspace, when it is sparse. Also proposed is a computationally more efficient alternative, which works well for PCA and LDA problems. Numerical studies reveal that the proposed algorithms are competitive, and that our tuning procedure works well. We demonstrate applications of the proposed algorithm to obtain sparse estimates for PCA, multiclass LDA, CCA, and SDR. Supplementary materials for this article are available online.     

A class of block alternating splitting implicit iteration methods for double saddle point linear systems

In the framework of a special block alternating splitting implicit (BASI) iteration scheme for generalized saddle point problems, we establish some new iteration methods for solving double saddle point problems by means of a suitable partitioning strategy. Convergence analysis of the corresponding BASI iteration methods indicates that they are convergent unconditionally under certain weak requirements for the related matrix splittings, which are satisfied directly for our specific application to double saddle point problems. Numerical examples for liquid crystal director and time-harmonic eddy current models are presented to demonstrate the efficiency of the proposed BASI preconditioners to accelerate the GMRES method.     

Second-order topological expansion for electrical impedance tomography

Second-order topological expansions in electrical impedance tomography problems with piecewise constant conductivities are considered. First-order expansions usually consist of local terms typically involving the state and the adjoint solutions and their gradients estimated at the point where the topological perturbation is performed. In the case of second-order topological expansions, non-local terms which have a higher computational cost appear. Interactions between several simultaneous perturbations are also considered. The study is aimed at determining the relevance of these non-local and interaction terms from a numerical point of view. A level set based shape algorithm is proposed and initialized by using topological sensitivity analysis.     

Simultaneous rayleigh-quotient minimization methods for Ax=λBx

New simultaneous iteration techniques are developed for solving the generalized eigenproblem Ax=λBx, where A and B are real symmetric matrices and B is positive definite. The approach is to minimize the generalized Rayleigh quotient in some sense over several independent vectors simultaneously. In particular, each new vector iterate is formed from a linear combination of current iterates and correction vectors that are derived from either gradient or conjugate-gradient techniques. A Ritz projection or simultaneous iteration process is used to accelerate convergence. For one of the gradient versions, convergence and asymptotic rates of convergence are established. Also, some numerical experiments are reported that demonstrate the convergence behavior of these methods.     

Approximate Newton Methods for Nonsmooth Equations

We develop general approximate Newton methods for solving Lipschitz continuous equations by replacing the iteration matrix with a consistently approximated Jacobian, thereby reducing the computation in the generalized Newton method. Locally superlinear convergence results are presented under moderate assumptions. To construct a consistently approximated Jacobian, we introduce two main methods: the classic difference approximation method and the -generalized Jacobian method. The former can be applied to problems with specific structures, while the latter is expected to work well for general problems. Numerical tests show that the two methods are efficient. Finally, a norm-reducing technique for the global convergence of the generalized Newton method is briefly discussed.     

连续Sylvester方程的广义正定和反Hermitian分裂迭代法及其超松弛加速

对于求解大型稀疏连续Sylvester方程,Bai提出了非常有效的Hermitian和反Hermitian分裂(HSS)迭代法.为了进一步提高求解这类方程的效率,本文建立一种广义正定和反Hermitian分裂(GPSS)迭代法,并且提出不精确GPSS(IGPSS)迭代法从而可以降低计算成本.对GPSS迭代法及其不精确变...     

Asymptotic theory of the reflection of electromagnetic radiation by moderately and highly conductive bodies

In this paper a method of deriving generalized impedance boundary conditions continuing tangential derivatives of high order is proposed. The case of reflection of an arbitrary electromagnetic wave by a curvilinear surface on which a generalized impedance condition holds is considered. The phenomenon of diffusion polarization dependent on the material and geometric properties of the reflecting surface is investigated. Bibliography: 5 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 203, 1992, pp. 68–82. Translated by M. A. Lyalinov.     

Mathematical model of conductive fabric-based flexible pressure sensor

This paper proposes a mathematical model of a pressure-sensitive conductive fabric sensor, which adopts the technique of electrical impedance tomography (EIT) with a composite fabric being capable of changing its effective electrical property due to an applied pressure. We model the composite fabric from an electrically conductive yarn and a sponge-like non-conductive fabric with high pore density, and the conductive yarn is woven in a wavy pattern to possess a pressure-sensitive conductive property, in the sense of homogenization theory. We use a simplified version of EIT technique to image the pressure distribution associated with the conductivity perturbation. A mathematical ground for the effective conductivity in one-direction is provided. We conduct an experiment to test the feasibility of the proposed pressure sensor.