default search action
Andrei Draganescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j10]Andrei Draganescu, Mona Hajghassem:
Optimal order multigrid preconditioners for the distributed control of parabolic equations with coarsening in space and time. Optim. Methods Softw. 37(5): 1930-1964 (2022) - 2021
- [j9]Junyong Park, Andrei Draganescu:
Testing homogeneity of several normal population means based on an interval hypothesis. Commun. Stat. Simul. Comput. 50(12): 4114-4131 (2021) - [j8]Andrew T. Barker, Andrei Draganescu:
Algebraic multigrid preconditioning of the Hessian in optimization constrained by a partial differential equation. Numer. Linear Algebra Appl. 28(1) (2021) - 2020
- [i2]Andrew T. Barker, Andrei Draganescu:
Algebraic multigrid preconditioning of the Hessian in PDE-constrained optimization. CoRR abs/2001.11533 (2020) - [i1]Harbir Antil, Andrei Draganescu, Kiefer Green:
A Note on Multigrid Preconditioning for Fractional PDE-Constrained Optimization Problems. CoRR abs/2010.14600 (2020)
2010 – 2019
- 2019
- [j7]Ana Maria Soane, Andrei Draganescu:
Multigrid Preconditioners for the Newton-Krylov Method in the Optimal Control of the Stationary Navier-Stokes Equations. SIAM J. Numer. Anal. 57(3): 1494-1523 (2019) - 2016
- [j6]Andrei Draganescu, Jyoti Saraswat:
Optimal-Order Preconditioners for Linear Systems Arising in the Semismooth Newton Solution of a Class of Control-Constrained Problems. SIAM J. Matrix Anal. Appl. 37(3): 1038-1070 (2016) - 2014
- [j5]Andrei Draganescu:
Multigrid preconditioning of linear systems for semi-smooth Newton methods applied to optimization problems constrained by smoothing operators. Optim. Methods Softw. 29(4): 786-818 (2014) - 2013
- [j4]Andrei Draganescu, Ana Maria Soane:
Multigrid solution of a distributed optimal control problem constrained by the Stokes equations. Appl. Math. Comput. 219(10): 5622-5634 (2013) - 2012
- [j3]Andrei Draganescu, Cosmin G. Petra:
Multigrid Preconditioning of Linear Systems for Interior Point Methods Applied to a Class of Box-constrained Optimal Control Problems. SIAM J. Numer. Anal. 50(1): 328-353 (2012)
2000 – 2009
- 2008
- [j2]Andrei Draganescu, Todd F. Dupont:
Optimal order multilevel preconditioners for regularized ill-posed problems. Math. Comput. 77(264): 2001-2038 (2008) - 2006
- [c2]Volkan Akcelik, George Biros, Andrei Draganescu, Omar Ghattas, Judith Hill, Bart G. van Bloemen Waanders:
Inversion of Airborne Contaminants in a Regional Model. International Conference on Computational Science (3) 2006: 481-488 - 2005
- [j1]Andrei Draganescu, Todd F. Dupont, L. Ridgway Scott:
Failure of the discrete maximum principle for an elliptic finite element problem. Math. Comput. 74(249): 1-23 (2005) - [c1]Volkan Akcelik, George Biros, Andrei Draganescu, Judith Hill, Omar Ghattas, Bart G. van Bloemen Waanders:
Dynamic Data-Driven Inversion For Terascale Simulations: Real-Time Identification Of Airborne Contaminants. SC 2005: 43
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint