MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • Computational Engineering (CE)
  • View Item
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • Computational Engineering (CE)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An Efficient Reduced-Order Approach for Nonaffine and Nonlinear Partial Differential Equations

Author(s)
Nguyen, N. C.; Peraire, Jaime
Thumbnail
DownloadCE002.pdf (445.9Kb)
Metadata
Show full item record
Abstract
In the presence of nonaffine and highly nonlinear terms in parametrized partial differential equations, the standard Galerkin reduced-order approach is no longer efficient, because the evaluation of these terms involves high computational complexity. An efficient reduced-order approach is developed to deal with “nonaffineness” and nonlinearity. The efficiency and accuracy of the approach are demonstrated on several test cases, which show significant computational savings relative to classical numerical methods and relative to the standard Galerkin reduced-order approach.
Date issued
2007-01
URI
http://hdl.handle.net/1721.1/35822
Series/Report no.
Computational Engineering (CE)
Keywords
Nonaffine Equations, Nonlinear Equations, Reduced-Order Approximation, Best Points Interpolation Method

Collections
  • Computational Engineering (CE)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.