共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
In this paper a new method for parameter estimation for elliptic partial differential equations is introduced. Parameter estimation includes minimizing an objective function, which is a measure for the difference between the parameter-dependent solution of the differential equation and some given data. We assume, that the given data results in a good approximation of the state of the system.In order to evaluate the objective function the solution of a differential equation has to be computed and hence, a large system of linear equations has to be solved. Minimization methods involve many evaluations of the objective function and therefore, the differential equation has to be solved multiple times. Thus, the computing time for parameter estimation can be large. Model order reduction was developed in order to reduce the computational effort of solving these differential equations multiple times. We use the given approximation of the state of the system as reduced basis and omit computing any snapshots. Therefore, our approach decreases the effort of the offline phase drastically. Furthermore, the dimension of the reduced system is one and thus, is much smaller than the dimension of other approaches. However, the obtained reduced model is a good approximation only close to the given data. Hence, the reduced system can lead to large errors for parameter sets, which correspond to solutions far away from the given approximation of the state of the system. In order to prevent convergence of the parameter estimator to such a local minimizer we penalise the approximation error between the full and the reduced system. 相似文献
3.
P.G. Constantine E.T. Phipps T.M. Wildey 《International journal for numerical methods in engineering》2014,99(3):183-202
We consider a multiphysics system with multiple component PDE models coupled together through network coupling interfaces, that is, a handful of scalars. If each component model contains uncertainties represented by a set of parameters, a straightforward uncertainty quantification study would collect all uncertainties into a single set and treat the multiphysics model as a black box. Such an approach ignores the rich structure of the multiphysics system, and the combined space of uncertainties can have a large dimension that prohibits the use of polynomial surrogate models. We propose an intrusive methodology that exploits the structure of the network coupled multiphysics system to efficiently construct a polynomial surrogate of the model output as a function of uncertain inputs. Using a nonlinear elimination strategy, we treat the solution as a composite function: the model outputs are functions of the coupling terms, which are functions of the uncertain parameters. The composite structure allows us to construct and employ a reduced polynomial basis that depends on the coupling terms. The basis can be constructed with many fewer PDE solves than the naive approach, which results in substantial computational savings. We demonstrate the method on an idealized model of a nuclear reactor. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
4.
Jen‐Yu Liu 《中国工程学刊》2013,36(3):301-306
Abstract The method of Chebyshev polynomials is introduced to represent approximate solutions of first‐order partial differential equations consisting of two independent variables. A set of linear algebraic equations is obtained by using the properties of Chebyshev polynomials and Kronecker product to analyse first‐order partial differential equations. The coefficient vector of Chebyshev polynomials of the first‐order partial differential equations can be obtained directly from Kronecker product formulas, which are suitable for computer computation. A numerical example for a set of first‐order partial differential equations is solved by a Chebyshev polynomials approximation and the results are satisfactory. 相似文献
5.
Dongbin Xiu 《工程优选》2013,45(6):489-504
A fast numerical approach for robust design optimization is presented. The core of the method is based on the state-of-the-art fast numerical methods for stochastic computations with parametric uncertainty. These methods employ generalized polynomial chaos (gPC) as a high-order representation for random quantities and a stochastic Galerkin (SG) or stochastic collocation (SC) approach to transform the original stochastic governing equations to a set of deterministic equations. The gPC-based SG and SC algorithms are able to produce highly accurate stochastic solutions with (much) reduced computational cost. It is demonstrated that they can serve as efficient forward problem solvers in robust design problems. Possible alternative definitions for robustness are also discussed. Traditional robust optimization seeks to minimize the variance (or standard deviation) of the response function while optimizing its mean. It can be shown that although variance can be used as a measure of uncertainty, it is a weak measure and may not fully reflect the output variability. Subsequently a strong measure in terms of the sensitivity derivatives of the response function is proposed as an alternative robust optimization definition. Numerical examples are provided to demonstrate the efficiency of the gPC-based algorithms, in both the traditional weak measure and the newly proposed strong measure. 相似文献
6.
M. Raisee D. Kumar C. Lacor 《International journal for numerical methods in engineering》2015,103(4):293-312
In this paper, a non‐intrusive stochastic model reduction scheme is developed for polynomial chaos representation using proper orthogonal decomposition. The main idea is to extract the optimal orthogonal basis via inexpensive calculations on a coarse mesh and then use them for the fine‐scale analysis. To validate the developed reduced‐order model, the method is implemented to: (1) the stochastic steady‐state heat diffusion in a square slab; (2) the incompressible, two‐dimensional laminar boundary‐layer over a flat plate with uncertainties in free‐stream velocity and physical properties; and (3) the highly nonlinear Ackley function with uncertain coefficients. For the heat diffusion problem, the thermal conductivity of the slab is assumed to be a stochastic field with known exponential covariance function and approximated via the Karhunen–Loève expansion. In all three test cases, the input random parameters are assumed to be uniformly distributed, and a polynomial chaos expansion is found using the regression method. The Sobol's quasi‐random sequence is used to generate the sample points. The numerical results of the three test cases show that the non‐intrusive model reduction scheme is able to produce satisfactory results for the statistical quantities of interest. It is found that the developed non‐intrusive model reduction scheme is computationally more efficient than the classical polynomial chaos expansion for uncertainty quantification of stochastic problems. The performance of the developed scheme becomes more apparent for the problems with larger stochastic dimensions and those requiring higher polynomial order for the stochastic discretization. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
7.
C. Herzet P. Héas A. Drémeau 《International journal for numerical methods in engineering》2018,113(3):479-511
This paper deals with model‐order reduction of parametric partial differential equations (PPDEs). More specifically, we consider the problem of finding a good approximation subspace of the solution manifold of the PPDE when only partial information on the latter is available. We assume that 2 sources of information are available: (a) a “rough” prior knowledge taking the form of a manifold containing the target solution manifold and (b) partial linear measurements of the solutions of the PPDE (the term partial refers to the fact that observation operators cannot be inverted). We provide and study several tools to derive good approximation subspaces from these 2 sources of information. We first identify the best worst‐case performance achievable in this setup and propose simple procedures to approximate the corresponding optimal approximation subspace. We then provide, in a simplified setup, a theoretical analysis relating the achievable reduction performance to the choice of the observation operator and the prior knowledge available on the solution manifold. 相似文献
8.
P. Surya Mohan Prasanth B. Nair Andy J. Keane 《International journal for numerical methods in engineering》2011,85(7):874-895
We present stochastic projection schemes for approximating the solution of a class of deterministic linear elliptic partial differential equations defined on random domains. The key idea is to carry out spatial discretization using a combination of finite element methods and stochastic mesh representations. We prove a result to establish the conditions that the input uncertainty model must satisfy to ensure the validity of the stochastic mesh representation and hence the well posedness of the problem. Finite element spatial discretization of the governing equations using a stochastic mesh representation results in a linear random algebraic system of equations in a polynomial chaos basis whose coefficients of expansion can be non‐intrusively computed either at the element or the global level. The resulting randomly parametrized algebraic equations are solved using stochastic projection schemes to approximate the response statistics. The proposed approach is demonstrated for modeling diffusion in a square domain with a rough wall and heat transfer analysis of a three‐dimensional gas turbine blade model with uncertainty in the cooling core geometry. The numerical results are compared against Monte–Carlo simulations, and it is shown that the proposed approach provides high‐quality approximations for the first two statistical moments at modest computational effort. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
9.
As a novel type of polynomial chaos expansion (PCE), the data-driven PCE (DD-PCE) approach has been developed to have a wide range of potential applications for uncertainty propagation. While the research on DD-PCE is still ongoing, its merits compared with the existing PCE approaches have yet to be understood and explored, and its limitations also need to be addressed. In this article, the Galerkin projection technique in conjunction with the moment-matching equations is employed in DD-PCE for higher-dimensional uncertainty propagation. The enhanced DD-PCE method is then compared with current PCE methods to fully investigate its relative merits through four numerical examples considering different cases of information for random inputs. It is found that the proposed method could improve the accuracy, or in some cases leads to comparable results, demonstrating its effectiveness and advantages. Its application in dealing with a Mars entry trajectory optimization problem further verifies its effectiveness. 相似文献
10.
Mircea Grigoriu 《International journal for numerical methods in engineering》2010,82(12):1537-1559
A practical method is developed for calculating statistics of the states of linear dynamic systems with deterministic properties subjected to non‐Gaussian noise and systems with uncertain properties subjected to Gaussian and non‐Gaussian noise. These classes of problems are relevant as most systems have uncertain properties, physical noise is rarely Gaussian, and the classical theory of linear random vibration applies to deterministic systems and can only deliver the first two moments of a system state if the noise is non‐Gaussian. The method (1) is based on approximate representations of all or some of the random elements in the definition of linear random vibration problems by stochastic reduced‐order models (SROMs), that is, simple random elements having a finite number of outcomes of unequal probabilities, (2) can be used to calculate statistics of a system state beyond its first two moments, and (3) establishes bounds on the discrepancy between exact and SROM‐based solutions of linear random vibration problems. The implementation of the method has required to integrate existing and new numerical algorithms. Examples are presented to illustrate the application of the proposed method and assess its accuracy. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
11.
M.‐L. Rapún F. Terragni J. M. Vega 《International journal for numerical methods in engineering》2015,104(9):844-868
An adaptive low‐dimensional model is considered to simulate time‐dependent dynamics in nonlinear dissipative systems governed by PDEs. The method combines an inexpensive POD‐based Galerkin system with short runs of a standard numerical solver that provides the snapshots necessary to first construct and then update the POD modes. Switching between the numerical solver and the Galerkin system is decided ‘on the fly’ by monitoring (i) a truncation error estimate and (ii) a residual estimate. The latter estimate is used to control the mode truncation instability and highly improves former adaptive strategies that detected this instability by monitoring consistency with a second instrumental Galerkin system based on a larger number of POD modes. The most computationally expensive run of the numerical solver occurs at the outset, when the whole set of POD modes is calculated. This step is improved by using mode libraries, which may either be generic or result from former applications of the method. The outcome is a flexible, robust, computationally inexpensive procedure that adapts itself to the local dynamics by using the faster Galerkin system for the majority of the time and few, on demand, short runs of a numerical solver. The method is illustrated considering the complex Ginzburg–Landau equation in one and two space dimensions. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
12.
A nonparametric probabilistic approach for quantifying uncertainties in low‐dimensional and high‐dimensional nonlinear models
下载免费PDF全文

A nonparametric probabilistic approach for modeling uncertainties in projection‐based, nonlinear, reduced‐order models is presented. When experimental data are available, this approach can also quantify uncertainties in the associated high‐dimensional models. The main underlying idea is twofold. First, to substitute the deterministic reduced‐order basis (ROB) with a stochastic counterpart. Second, to construct the probability measure of the stochastic reduced‐order basis (SROB) on a subset of a compact Stiefel manifold in order to preserve some important properties of a ROB. The stochastic modeling is performed so that the probability distribution of the constructed SROB depends on a small number of hyperparameters. These are determined by solving a reduced‐order statistical inverse problem. The mathematical properties of this novel approach for quantifying model uncertainties are analyzed through theoretical developments and numerical simulations. Its potential is demonstrated through several example problems from computational structural dynamics. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
13.
D. Lucor C.‐H. Su G. E. Karniadakis 《International journal for numerical methods in engineering》2004,60(3):571-596
We present a new approach to obtain solutions for general random oscillators using a broad class of polynomial chaos expansions, which are more efficient than the classical Wiener–Hermite expansions. The approach is general but here we present results for linear oscillators only with random forcing or random coefficients. In this context, we are able to obtain relatively sharp error estimates in the representation of the stochastic input as well as the solution. We have also performed computational comparisons with Monte Carlo simulations which show that the new approach can be orders of magnitude faster, especially for compact distributions. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
14.
N. Mai‐Duy R. I. Tanner 《International journal for numerical methods in engineering》2005,63(11):1636-1654
This paper reports a new numerical method based on radial basis function networks (RBFNs) for solving high‐order partial differential equations (PDEs). The variables and their derivatives in the governing equations are represented by integrated RBFNs. The use of integration in constructing neural networks allows the straightforward implementation of multiple boundary conditions and the accurate approximation of high‐order derivatives. The proposed RBFN method is verified successfully through the solution of thin‐plate bending and viscous flow problems which are governed by biharmonic equations. For thermally driven cavity flows, the solutions are obtained up to a high Rayleigh number of 107. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
15.
Andrea Ferrero Angelo Iollo Francesco Larocca 《International journal for numerical methods in engineering》2018,116(5):332-357
Proper orthogonal decomposition (POD) allows to compress information by identifying the most energetic modes obtained from a database of snapshots. In this work, POD is used to predict the behavior of compressible flows by means of global and local approaches, which exploit some features of a discontinuous Galerkin spatial discretization. The presented global approach requires the definition of high‐order and low‐order POD bases, which are built from a database of high‐fidelity simulations. Predictions are obtained by performing a cheap low‐order simulation whose solution is projected on the low‐order basis. The projection coefficients are then used for the reconstruction with the high‐order basis. However, the nonlinear behavior related to the advection term of the governing equations makes the use of global POD bases quite problematic. For this reason, a second approach is presented in which an empirical POD basis is defined in each element of the mesh. This local approach is more intrusive with respect to the global approach but it is able to capture better the nonlinearities related to advection. The two approaches are tested and compared on the inviscid compressible flow around a gas‐turbine cascade and on the compressible turbulent flow around a wind turbine airfoil. 相似文献
16.
Bangti Jin 《International journal for numerical methods in engineering》2008,76(2):230-252
This paper presents two techniques, i.e. the proper orthogonal decomposition (POD) and the stochastic collocation method (SCM), for constructing surrogate models to accelerate the Bayesian inference approach for parameter estimation problems associated with partial differential equations. POD is a model reduction technique that derives reduced‐order models using an optimal problem‐adapted basis to effect significant reduction of the problem size and hence computational cost. SCM is an uncertainty propagation technique that approximates the parameterized solution and reduces further forward solves to function evaluations. The utility of the techniques is assessed on the non‐linear inverse problem of probabilistically calibrating scalar Robin coefficients from boundary measurements arising in the quenching process and non‐destructive evaluation. A hierarchical Bayesian model that handles flexibly the regularization parameter and the noise level is employed, and the posterior state space is explored by the Markov chain Monte Carlo. The numerical results indicate that significant computational gains can be realized without sacrificing the accuracy. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
17.
M. Lei;C. Z. Shi;P. H. Wen;J. Sladek;V. Sladek; 《International journal for numerical methods in engineering》2024,125(7):e7416
Based on the Garlerkin method, the Galerkin finite block method (GFBM) is proposed to deal with two-dimensional (2D) linear partial differential equations (PDEs) with variable coefficients in this paper. The mapping technique is utilized to transform a block in physical domain into normalized square. Physical variables are approximated with double layer Chebyshev polynomials for 2D problem. A set of linear algebraic equation is formulated with the Chebyshev polynomials from PDE and boundary conditions in weak form. Continuous conditions at interfacial surfaces between two blocks are introduced in either weak form or strong form. It is demonstrated that the GFBM is suitable to deal with complicated problems with high accuracy including discontinuous boundary values problem and concentrated heat sources in the domain. Several numerical examples are presented to demonstrate the accuracy and efficiency of the proposed method. 相似文献
18.
N. C. Nguyen J. Peraire 《International journal for numerical methods in engineering》2008,76(1):27-55
For general non-linear parametrized partial differential equations (PDEs), the standard Galerkin projection is no longer efficient to generate reduced-order models. This is because the evaluation of the integrals involving the non-linear terms has a high computational complexity and cannot be pre-computed. This situation also occurs for linear equations when the parametric dependence is nonaffine. In this paper, we propose an efficient approach to generate reduced-order models for large-scale systems derived from PDEs, which may involve non-linear terms and nonaffine parametric dependence. The main idea is to replace the non-linear and nonaffine terms with a coefficient-function approximation consisting of a linear combination of pre-computed basis functions with parameter-dependent coefficients. The coefficients are determined efficiently by an inexpensive and stable interpolation at some pre-computed points. The efficiency and accuracy of this method are demonstrated on several test cases, which show significant computational savings relative to the standard Galerkin projection reduced-order approach. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
19.
A. Nouy A. Clément 《International journal for numerical methods in engineering》2010,83(10):1312-1344
An eXtended Stochastic Finite Element Method has been recently proposed for the numerical solution of partial differential equations defined on random domains. This method is based on a marriage between the eXtended Finite Element Method and spectral stochastic methods. In this article, we propose an extension of this method for the numerical simulation of random multi‐phased materials. The random geometry of material interfaces is described implicitly by using random level set functions. A fixed deterministic finite element mesh, which is not conforming to the random interfaces, is then introduced in order to approximate the geometry and the solution. Classical spectral stochastic finite element approximation spaces are not able to capture the irregularities of the solution field with respect to spatial and stochastic variables, which leads to a deterioration of the accuracy and convergence properties of the approximate solution. In order to recover optimal convergence properties of the approximation, we propose an extension of the partition of unity method to the spectral stochastic framework. This technique allows the enrichment of approximation spaces with suitable functions based on an a priori knowledge of the irregularities in the solution. Numerical examples illustrate the efficiency of the proposed method and demonstrate the relevance of the enrichment procedure. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
20.
We propose to improve the efficiency of the computation of the reduced‐state variables related to a given reduced basis. This basis is supposed to be built by using the snapshot proper orthogonal decomposition (POD) model reduction method. In the framework of non‐linear mechanical problems involving internal variables, the local integration of the constitutive laws can dramatically limit the computational savings provided by the reduction of the order of the model. This drawback is due to the fact that, using a Galerkin formulation, the size of the reduced basis has no effect on the complexity of the constitutive equations. In this paper we show how a reduced‐basis approximation and a Petrov–Galerkin formulation enable to reduce the computational effort related to the internal variables. The key concept is a reduced integration domain where the integration of the constitutive equations is performed. The local computations being not made over the entire domain, we extrapolate the computed internal variable over the full domain using POD vectors related to the internal variables. This paper shows the improvement of the computational saving obtained by the hyper‐reduction of the elasto‐plastic model of a simple structure. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献