The Experts below are selected from a list of 321 Experts worldwide ranked by ideXlab platform
C. Soize - One of the best experts on this subject based on the ideXlab platform.
-
Non‐Gaussian Positive‐Definite Matrix‐valued random fields with constrained eigenvalues: Application to random elasticity tensors with uncertain material symmetries
International Journal for Numerical Methods in Engineering, 2011Co-Authors: Johann Guilleminot, C. SoizeAbstract:This paper is devoted to the construction of a class of prior stochastic models for non-Gaussian Positive-Definite Matrix-valued random fields. The proposed class allows the variances of selected random eigenvalues to be specified and exhibits a larger number of parameters than the other classes previously derived within a nonparametric framework. Having recourse to a particular characterization of material symmetry classes, we then propose a mechanical interpretation of the constraints and subsequently show that the probabilistic model may allow prescribing higher statistical fluctuations in given directions. Such stochastic fields turn out to be especially suitable for experimental identification under material symmetry uncertainties, as well as for the development of computational multi-scale approaches where the randomness induced by fine-scale features may be taken into account. We further present a possible strategy for inverse identification, relying on the sequential solving of least-square optimization problems. An application is finally provided. Copyright (c) 2011 John Wiley & Sons, Ltd.
-
Non-Gaussian Positive-Definite Matrix-valued random fields with constrained eigenvalues: Application to random elasticity tensors with uncertain material symmetries
International Journal for Numerical Methods in Engineering, 2011Co-Authors: Johann Guilleminot, C. SoizeAbstract:This paper is devoted to the construction of a class of prior stochastic models for non-Gaussian Positive-Definite Matrix-valued random fields. The proposed class allows the variances of selected random eigenvalues to be specified and exhibits a larger number of parameters than the other classes previously derived within a nonparametric framework. Having recourse to a particular characterization of material symmetry classes, we then propose a mechanical interpretation of the constraints and subsequently show that the probabilistic model may allow prescribing higher statistical fluctuations in given directions. Such stochastic fields turn out to be especially suitable for experimental identification under material symmetry uncertainties, as well as for the development of computational multi-scale approaches where the randomness induced by fine-scale features may be taken into account. We further present a possible strategy for inverse identification, relying on the sequential solving of least-square optimization problems. An application is finally provided. Copyright (c) 2011 John Wiley & Sons, Ltd.
-
Non-Gaussian Positive-Definite Matrix-valued random fields for elliptic stochastic partial differential operators
Computer Methods in Applied Mechanics and Engineering, 2006Co-Authors: C. SoizeAbstract:International audienceThis paper deals with the construction of a class of non-Gaussian Positive-Definite Matrix-valued random fields whose mathematical properties allow elliptic stochastic partial differential operators to be modeled. The properties of this class is studied in details and the numerical procedure for constructing numerical realizations of the trajectories is explicitly given. Such a Matrix-valued random field can directly be used for modeling random uncertainties in computational sciences with a stochastic model having a small number of parameters. The class of random fields which can be approximated is presented and their experimental identification is analyzed. An example is given in three-dimensional linear elasticity for which the fourth-order elasticity tensor-valued random field is constructed for a random non-homogeneous anisotropic elastic material
-
Non-Gaussian Positive-Definite Matrix-valued random fields for elliptic stochastic partial differential operators
Computer Methods in Applied Mechanics and Engineering, 2006Co-Authors: C. SoizeAbstract:This paper deals with the construction of a class of non-Gaussian Positive-Definite Matrix-valued random fields whose mathematical properties allow elliptic stochastic partial differential operators to be modeled. The properties of this class is studied in details and the numerical procedure for constructing numerical realizations of the trajectories is explicitly given. Such a Matrix-valued random field can directly be used for modeling random uncertainties in computational sciences with a stochastic model having a small number of parameters. The class of random fields which can be approximated is presented and their experimental identification is analyzed. An example is given in three-dimensional linear elasticity for which the fourth-order elasticity tensor-valued random field is constructed for a random non-homogeneous anisotropic elastic material.
-
Non Gaussian Matrix-valued random fields for nonparametric probabilistic modeling of elliptic stochastic partial differential operators
2004Co-Authors: C. SoizeAbstract:This paper deals with the construction of a non Gaussian Positive-Definite Matrix-valued random field whose mathematical properties allow elliptic stochastic partial differential operators to be modeled. Such a Matrix- valued random field can directly be used for modeling random uncertainties in computational sciences with a stochastic model having a small number of parameters. The non Gaussian Positive-Definite Matrix-valued random field presented in this paper allows such a probabilistic model of the fourth-order tensor-valued random field to be constructed and depends only of 4 scalar parameters: three spatial correlation lengths and one parameter allowing the level of the random fluctuations to be controlled. Such a model can directly be used in the stochastic finite element method.
Nobuo Yamashita - One of the best experts on this subject based on the ideXlab platform.
-
Analysis of Sparse Quasi-Newton Updates with Positive Definite Matrix Completion
Journal of the Operations Research Society of China, 2014Co-Authors: Yu-hong Dai, Nobuo YamashitaAbstract:Based on the idea of maximum determinant Positive Definite Matrix completion, Yamashita (Math Prog 115(1):1–30, 2008) proposed a new sparse quasi-Newton update, called MCQN, for unconstrained optimization problems with sparse Hessian structures. In exchange of the relaxation of the secant equation, the MCQN update avoids solving difficult subproblems and overcomes the ill-conditioning of approximate Hessian matrices. However, local and superlinear convergence results were only established for the MCQN update with the DFP method. In this paper, we extend the convergence result to the MCQN update with the whole Broyden’s convex family. Numerical results are also reported, which suggest some efficient ways of choosing the parameter in the MCQN update the Broyden’s family.
-
Convergence analysis of sparse quasi-Newton updates with Positive Definite Matrix completion for two-dimensional functions
Numerical Algebra Control & Optimization, 2011Co-Authors: Yu-hong Dai, Nobuo YamashitaAbstract:In this paper, we briefly review the extensions of quasi-Newton methods for large-scale optimization. Specially, based on the idea of maximum determinant Positive Definite Matrix completion, Yamashita (2008) proposed a new sparse quasi-Newton update, called MCQN, for unconstrained optimization problems with sparse Hessian structures. In exchange of the relaxation of the secant equation, the MCQN update avoids solving difficult subproblems and overcomes the ill-conditioning of approximate Hessian matrices. A global convergence analysis is given in this paper for the MCQN update with Broyden's convex family assuming that the objective function is uniformly convex and its dimension is only two.   This paper is dedicated to Professor Masao Fukushima on occasion of his 60th birthday.
-
Sparse quasi-Newton updates with Positive Definite Matrix completion
Mathematical Programming, 2008Co-Authors: Nobuo YamashitaAbstract:Quasi-Newton methods are powerful techniques for solving unconstrained minimization problems. Variable metric methods, which include the BFGS and DFP methods, generate dense Positive Definite approximations and, therefore, are not applicable to large-scale problems. To overcome this difficulty, a sparse quasi-Newton update with Positive Definite Matrix completion that exploits the sparsity pattern $$E :=\{(i, j)\;|\; (\nabla^2 f(x))_{ij} \neq 0\,{\rm for\,some}\, x \in R^n\}$$ of the Hessian is proposed. The proposed method first calculates a partial approximate Hessian $$H^{QN}_{ij}, (i, j) \in F$$ , where $$F \supseteq E$$ , using an existing quasi-Newton update formula such as the BFGS or DFP methods. Next, a full Matrix H _ k +1, which is a maximum-determinant Positive Definite Matrix completion of $$H^{QN}_{ij}, (i, j) \in F$$ , is obtained. If the sparsity pattern E (or its extension F ) has a property related to a chordal graph, then the Matrix H _ k +1 can be expressed as products of some sparse matrices. The time and space requirements of the proposed method are lower than those of the BFGS or the DFP methods. In particular, when the Hessian Matrix is tridiagonal, the complexities become O ( n ). The proposed method is shown to have superlinear convergence under the usual assumptions.
Eun Heui Kim - One of the best experts on this subject based on the ideXlab platform.
-
Multisplitting preconditioners for a symmetric Positive Definite Matrix
Journal of Applied Mathematics and Computing, 2006Co-Authors: Jae Heon Yun, Eun Heui KimAbstract:We study convergence of multisplitting method associated with a block diagonal conformable multisplitting for solving a linear system whose coefficient Matrix is a symmetric Positive Definite Matrix which is not an H-Matrix. Next, we study the validity ofm-step multisplitting polynomial preconditioners which will be used in the preconditioned conjugate gradient method.
-
Convergence of multisplitting method for a symmetric Positive Definite Matrix
Journal of Applied Mathematics and Computing, 2005Co-Authors: Jae Heon Yun, Eun Heui KimAbstract:We study convergence of symmetric multisplitting method associated with many different multisplittings for solving a linear system whose coefficient Matrix is a symmetric Positive Definite Matrix which is not an H-Matrix.
Johann Guilleminot - One of the best experts on this subject based on the ideXlab platform.
-
Non‐Gaussian Positive‐Definite Matrix‐valued random fields with constrained eigenvalues: Application to random elasticity tensors with uncertain material symmetries
International Journal for Numerical Methods in Engineering, 2011Co-Authors: Johann Guilleminot, C. SoizeAbstract:This paper is devoted to the construction of a class of prior stochastic models for non-Gaussian Positive-Definite Matrix-valued random fields. The proposed class allows the variances of selected random eigenvalues to be specified and exhibits a larger number of parameters than the other classes previously derived within a nonparametric framework. Having recourse to a particular characterization of material symmetry classes, we then propose a mechanical interpretation of the constraints and subsequently show that the probabilistic model may allow prescribing higher statistical fluctuations in given directions. Such stochastic fields turn out to be especially suitable for experimental identification under material symmetry uncertainties, as well as for the development of computational multi-scale approaches where the randomness induced by fine-scale features may be taken into account. We further present a possible strategy for inverse identification, relying on the sequential solving of least-square optimization problems. An application is finally provided. Copyright (c) 2011 John Wiley & Sons, Ltd.
-
Non-Gaussian Positive-Definite Matrix-valued random fields with constrained eigenvalues: Application to random elasticity tensors with uncertain material symmetries
International Journal for Numerical Methods in Engineering, 2011Co-Authors: Johann Guilleminot, C. SoizeAbstract:This paper is devoted to the construction of a class of prior stochastic models for non-Gaussian Positive-Definite Matrix-valued random fields. The proposed class allows the variances of selected random eigenvalues to be specified and exhibits a larger number of parameters than the other classes previously derived within a nonparametric framework. Having recourse to a particular characterization of material symmetry classes, we then propose a mechanical interpretation of the constraints and subsequently show that the probabilistic model may allow prescribing higher statistical fluctuations in given directions. Such stochastic fields turn out to be especially suitable for experimental identification under material symmetry uncertainties, as well as for the development of computational multi-scale approaches where the randomness induced by fine-scale features may be taken into account. We further present a possible strategy for inverse identification, relying on the sequential solving of least-square optimization problems. An application is finally provided. Copyright (c) 2011 John Wiley & Sons, Ltd.
Jae Heon Yun - One of the best experts on this subject based on the ideXlab platform.
-
Multisplitting preconditioners for a symmetric Positive Definite Matrix
Journal of Applied Mathematics and Computing, 2006Co-Authors: Jae Heon Yun, Eun Heui KimAbstract:We study convergence of multisplitting method associated with a block diagonal conformable multisplitting for solving a linear system whose coefficient Matrix is a symmetric Positive Definite Matrix which is not an H-Matrix. Next, we study the validity ofm-step multisplitting polynomial preconditioners which will be used in the preconditioned conjugate gradient method.
-
Parallel relaxed multisplitting methods for a symmetric Positive Definite Matrix
Applied Mathematics and Computation, 2006Co-Authors: Jae Heon Yun, Sang Wook KimAbstract:We first study convergence of both the relaxed multisplitting method and the relaxed (nonstationary) two-stage multisplitting method using incomplete factorizations for solving a linear system whose coefficient Matrix is a large sparse symmetric Positive Definite Matrix. We next study a parallel implementation of the relaxed two-stage multisplitting method using incomplete factorizations as inner splittings and an application of the relaxed two-stage multisplitting method to parallel preconditioner of the CG (conjugate gradient) method. Lastly, we provide parallel performance results of both the relaxed two-stage multisplitting method and the CG method with a parallel preconditioner which is derived from the relaxed two-stage multisplitting method on the IBM p690 supercomputer.
-
Convergence of multisplitting method for a symmetric Positive Definite Matrix
Journal of Applied Mathematics and Computing, 2005Co-Authors: Jae Heon Yun, Eun Heui KimAbstract:We study convergence of symmetric multisplitting method associated with many different multisplittings for solving a linear system whose coefficient Matrix is a symmetric Positive Definite Matrix which is not an H-Matrix.
-
MODIFLED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC Positive Definite Matrix
Bulletin of The Korean Mathematical Society, 2002Co-Authors: Jae Heon Yun, Yu-du HanAbstract:We propose variants of the modified incomplete Cho1esky factorization preconditioner for a symmetric Positive Definite (SPD) Matrix. Spectral properties of these preconditioners are discussed, and then numerical results of the preconditioned CG (PCG) method using these preconditioners are provided to see the effectiveness of the preconditioners.