An iterative method for a Cauchy problem for the heat equation

An iterative method for reconstruction of the solution to a parabolic initial boundary value problem of second order from Cauchy data is presented. The data are given on a part of the boundary. At each iteration step, a series of well-posed mixed boundary value problems are solved for the parabolic operator and its adjoint. The convergence proof of this method in a weighted L2-space is included.

Mode-locking intracavity dynamics:modeling nonlinear power and energy fluctuations

Modern high-power, pulsed lasers are driven by strong intracavity fluctuations. Critical in driving the intracavity dynamics is the nontrivial phase profiles generated and their periodic modification from either nonlinear mode-coupling, spectral filtering or dispersion management. Understanding the theoretical origins of the intracavity fluctuations helps guide the design, optimization and construction of efficient, high-power and high-energy pulsed laser cavities. Three specific mode-locking component are presented for enhancing laser energy: waveguide arrays, spectral filtering and dispersion management. Each component drives a strong intracavity dynamics that is captured through various modeling and analytic techniques.

Generalized KPCA by adaptive rules in feature space

Principal component analysis (PCA) is well recognized in dimensionality reduction, and kernel PCA (KPCA) has also been proposed in statistical data analysis. However, KPCA fails to detect the nonlinear structure of data well when outliers exist. To reduce this problem, this paper presents a novel algorithm, named iterative robust KPCA (IRKPCA). IRKPCA works well in dealing with outliers, and can be carried out in an iterative manner, which makes it suitable to process incremental input data. As in the traditional robust PCA (RPCA), a binary field is employed for characterizing the outlier process, and the optimization problem is formulated as maximizing marginal distribution of a Gibbs distribution. In this paper, this optimization problem is solved by stochastic gradient descent techniques. In IRKPCA, the outlier process is in a high-dimensional feature space, and therefore kernel trick is used. IRKPCA can be regarded as a kernelized version of RPCA and a robust form of kernel Hebbian algorithm. Experimental results on synthetic data demonstrate the effectiveness of IRKPCA. © 2010 Taylor & Francis.