Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Tarek P. Mathew"'
Publikováno v:
SIAM Journal on Scientific Computing. 32:1180-1200
In this paper, we describe block matrix algorithms for the iterative solution of a large-scale linear-quadratic optimal control problem involving a parabolic partial differential equation over a finite control horizon. We consider an “all at once
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de55628c8977448e116cccc5ec36906d
https://doi.org/10.1137/080717481
https://doi.org/10.1137/080717481
Autor:
Shagi-Di Shih, Tarek P. Mathew
Publikováno v:
Natural Resource Modeling. 13:389-418
This work surveys techniques of Grasman and Veling [1973], Vasil'eva and Belyanin [1988] and Shih [1996] for computing the relaxation oscillation period of singularly perturbed Lotka-Volterra systems. Grasman and Veling [1973] used an implicit functi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9231b7eae8ce466d8ad3ec33940938e
https://doi.org/10.1111/j.1939-7445.2000.tb00040.x
https://doi.org/10.1111/j.1939-7445.2000.tb00040.x
Publikováno v:
Numerical Linear Algebra with Applications. 14:257-279
In this paper, we describe and analyse several block matrix iterative algorithms for solving a saddle point linear system arising from the discretization of a linear-quadratic elliptic control problem with Neumann boundary conditions. To ensure that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe16318949b8820b86bd5ef619230b40
https://doi.org/10.1002/nla.526
https://doi.org/10.1002/nla.526
Publikováno v:
SIAM Journal on Numerical Analysis. 37:1709-1728
In this paper, we provide a maximum norm analysis of a finite difference scheme defined on overlapping nonmatching grids for second order elliptic equations. We consider a domain which is the union of p overlapping subdomains where each subdomain has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e473013a34aff2336668b106bd160d69
https://doi.org/10.1137/s0036142998348741
https://doi.org/10.1137/s0036142998348741
Publikováno v:
SIAM Journal on Scientific Computing. 15:1349-1374
Several variants of the vertex space algorithm of Smith for two-dimensional elliptic problems are described. The vertex space algorithm is a domain decomposition method based on nonoverlapping subregions, in which the reduced Schur complement system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2eb089d4b20eeb14898cadbdc6d9a55
https://doi.org/10.1137/0915082
https://doi.org/10.1137/0915082
Autor:
Tony F. Chan, Tarek P. Mathew
Publikováno v:
Contemporary Mathematics. :157-175
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa23a65bf3f3084772bae795c2cf99b8
https://doi.org/10.1090/conm/157/01416
https://doi.org/10.1090/conm/157/01416
Autor:
Tarek P. Mathew
Publikováno v:
Numerische Mathematik. 65:469-492
In this paper we discuss bounds for the convergence rates of several domain decomposition algorithms to solve symmetric, indefinite linear systems arising from mixed finite element discretizations of elliptic problems. The algorithms include Schwarz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5103469456137378c8e7fa4e00467c6
https://doi.org/10.1007/bf01385763
https://doi.org/10.1007/bf01385763
Autor:
Tarek P. Mathew
Publikováno v:
Numerische Mathematik. 65:445-468
We describe sequential and parallel algorithms based on the Schwarz alternating method for the solution of mixed finite element discretizations of elliptic problems using the Raviart-Thomas finite element spaces. These lead to symmetric indefinite li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8cf908030a92ad718aac19acc626ef66
https://doi.org/10.1007/bf01385762
https://doi.org/10.1007/bf01385762
Autor:
Tarek P. Mathew, Tony F. Chan
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 13:212-238
The interface probing technique, which was developed and used by Chan and Resasco and Keyes and Gropp, is an algebraic technique for constructing interface preconditioners in domain decomposition algorithms. The basic technique is to approximate inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17e09bde0a98a37a991f196f67ce98ee
https://doi.org/10.1137/0613018
https://doi.org/10.1137/0613018
Publikováno v:
Lecture Notes in Computational Science and Engineering ISBN: 9783540751984
We consider an elliptic optimal control problem in two dimensions, in which the control variable corresponds to the Neumann data on a boundary segment, and where the performance functional is regularized to ensure that the problem is well posed. A fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11df874e06bde8f06aa20ae9577189e5
https://doi.org/10.1007/978-3-540-75199-1_66
https://doi.org/10.1007/978-3-540-75199-1_66
