default search action
Petter E. Bjørstad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [j8]Talal Rahman, Petter E. Bjørstad, Xuejun Xu:
The Crouzeix-Raviart FE on Nonmatching Grids with an Approximate Mortar Condition. SIAM J. Numer. Anal. 46(1): 496-516 (2007) - 2003
- [j7]Petter E. Bjørstad, Maksymilian Dryja, Talal Rahman:
Additive Schwarz Methods for Elliptic Mortar Finite Element Problems. Numerische Mathematik 95(3): 427-457 (2003) - [c6]Petter E. Bjørstad, Jacko Koster:
Balancing Domain Decomposition Applied to Structural Analysis Problems. PARCO 2003: 845-852 - 2001
- [c5]Petter E. Bjørstad, Piotr Krzyzanowski:
A Flexible 2-Level Neumann-Neumann Method for Structural Analysis Problems. PPAM 2001: 387-394 - 2000
- [j6]Petter E. Bjørstad:
Coordinate free numerics. Sci. Program. 8(4): 209- (2000) - [c4]Petter E. Bjørstad, Jacko Koster, Piotr Krzyzanowski:
Domain Decomposition Solvers for Large Scale Industrial Finite Element Problems. PARA 2000: 373-383
1990 – 1999
- 1999
- [j5]Petter E. Bjørstad, Bjørn Peter Tjøstheim:
High Precision Solutions of Two Fourth Order Eigenvalue Problems. Computing 63(2): 97-107 (1999) - 1997
- [j4]Petter E. Bjørstad, Bjørn Peter Tjøstheim:
Timely Communication: Efficient Algorithms for Solving a Fourth-Order Equation with the Spectral-Galerkin Method. SIAM J. Sci. Comput. 18(2): 621-632 (1997) - 1996
- [c3]Petter E. Bjørstad, Randi Moe, Rudi Olufsen, Eero Vainikko:
Parallel Reservoir Simultation Based on Domain Decomposition Techniques. HPCN Europe 1996: 3-11 - [c2]Jeremy Cook, Petter E. Bjørstad, Jon Braekhus:
Multilevel Parallel Solution of Large, Sparse Finite Element Equations from Structural Analysis. HPCN Europe 1996: 404-412 - [c1]Petter E. Bjørstad, Maksimillian Dryja, Eero Vainikko:
Parallel Implementation of a Schwarz Domain Decomposition Algorithm. PARA 1996: 46-56 - 1995
- [p1]Petter E. Bjørstad, Terje Kårstad:
3. Domain Decomposition, Parallel Computing and Petroleum Engineering. Domain-Based Parallelism and Problem Decomposition Methods in Computational Science and Engineering 1995: 39-56 - [e1]David H. Bailey, Petter E. Bjørstad, John R. Gilbert, Michael Mascagni, Robert S. Schreiber, Horst D. Simon, Virginia Torczon, Layne T. Watson:
Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, PP 1995, San Francisco, California, USA, February 15-17, 1995. SIAM 1995, ISBN 0-89871-344-7 [contents] - 1992
- [j3]Petter E. Bjørstad, Fredrik Manne, Tor Sørevik, Marián Vajtersic:
Efficient Matrix Multiplication on SIMD Computers. SIAM J. Matrix Anal. Appl. 13(1): 386-401 (1992) - 1990
- [j2]Petter E. Bjørstad:
An Inequality in Linear Algebra. SIAM Rev. 32(1): 141 (1990)
1980 – 1989
- 1987
- [j1]Petter E. Bjørstad:
A large scale, sparse, secondary storage, direct linear equation solver for structural analysis and its implementation on vector and parallel architectures. Parallel Comput. 5(1-2): 3-12 (1987)
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-07-04 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint