Stochastic Galerkin Method and Hierarchical Preconditioning for PDE-constrained Optimization

We develop efficient hierarchical preconditioners for optimal control problems governed by partial differential equations with uncertain coefficients. Adopting a discretize-then-optimize framework that integrates finite element discretization, stochastic Galerkin approximation, and advanced time-discretization schemes, the approach addresses the challenge of large-scale, ill-conditioned linear systems arising in uncertainty quantification. By exploiting the sparsity inherent in generalized polynomial chaos expansions, we derive hierarchical preconditioners based on truncated stochastic expansion that strike an effective balance between computational cost and preconditioning quality. Numerical experiments demonstrate that the proposed preconditioners significantly accelerate the convergence of iterative solvers compared to existing methods, providing robust and efficient solvers for both steady-state and time-dependent optimal control applications under uncertainty.

Authors

Publication Details

Journal
Maryland Shared Open Access Repository (USMAI Consortium)
Published
2025-12-29
DOI
https://doi.org/10.13016/m2f7r1-sow2
Primary Topic
Probabilistic and Robust Engineering Design
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Stochastic Galerkin Method and Hierarchical Preconditioning for PDE-constrained Optimization

Akwum Onwunta, Bedřich Sousedík, Zhi Li
Maryland Shared Open Access Repository (USMAI Consortium)
Probabilistic and Robust Engineering Design
article

Stochastic Galerkin Method and Hierarchical Preconditioning for PDE-constrained Optimization

Akwum Onwunta, Bedřich Sousedík, Zhi Li
article en

Abstract

We develop efficient hierarchical preconditioners for optimal control problems governed by partial differential equations with uncertain coefficients. Adopting a discretize-then-optimize framework that integrates finite element discretization, stochastic Galerkin approximation, and advanced time-discretization schemes, the approach addresses the challenge of large-scale, ill-conditioned linear systems arising in uncertainty quantification. By exploiting the sparsity inherent in generalized polynomial chaos expansions, we derive hierarchical preconditioners based on truncated stochastic expansion that strike an effective balance between computational cost and preconditioning quality. Numerical experiments demonstrate that the proposed preconditioners significantly accelerate the convergence of iterative solvers compared to existing methods, providing robust and efficient solvers for both steady-state and time-dependent optimal control applications under uncertainty.

Maryland Shared Open Access Repository (USMAI Consortium)
Openalex Percentile: Top 24%
Probabilistic and Robust Engineering Design
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Stochastic Galerkin Method and Hierarchical Preconditioning for PDE-constrained Optimization — Akwum Onwunta, Bedřich Sousedík, et al. · Maryland Shared Open Access Repository (USMAI Consortium) (2025) | TGRS Research Map | TGRS