default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlan Bar-On
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j10]Ilan Bar-On, Mauro Leoncini:
Reliable parallel solution of bidiagonal systems. Numerische Mathematik 90(3): 415-440 (2002)- 2000
- [j9]Ilan Bar-On, Mauro Leoncini:
Reliable Solution of Tridiagonal Systems of Linear Equations. SIAM J. Numer. Anal. 38(4): 1134-1153 (2000)
1990 – 1999
- 1998
- [j8]Ilan Bar-On, Marcin Paprzycki
:
High performance solution of the complex symmetric eigenproblem. Numer. Algorithms 18(2): 195-208 (1998) - [j7]Ilan Bar-On, Mauro Leoncini:
Stable solution of tridiagonal systems. Numer. Algorithms 18(3-4): 361-388 (1998) - [c4]Åke Edlund, Ilan Bar-On, Uri Peskin:
Parallel Computation of Multidimensional Scattering Wavefunctions for Helmholtz/Schroedinger Equations. PARA 1998: 112-119 - 1997
- [j6]Ilan Bar-On, Bruno Codenotti, Mauro Leoncini:
A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices. SIAM J. Matrix Anal. Appl. 18(2): 403-418 (1997) - [j5]Ilan Bar-On, Victor Ryaboy:
Fast Diagonalization of Large and Dense Complex Symmetric Matrices, with Applications to Quantum Reaction Dynamics. SIAM J. Sci. Comput. 18(5): 1412-1435 (1997) - [c3]Ilan Bar-On, Mauro Leoncini:
How Does One Solve a Tridiagonal System of Linear Equations? LSSC 1997: 293-300 - 1996
- [j4]Ilan Bar-On:
Interlacing Properties of Tridiagonal Symmetric Matrices with Applications to Parallel Computing. SIAM J. Matrix Anal. Appl. 17(3): 548-562 (1996) - 1995
- [c2]Ilan Bar-On, Victor Ryaboy:
A New Fast Algorithm for the Diagonalization of Complex Symmetric Matrices, with Applications to Quantum Dynamics. PP 1995: 571-572 - 1992
- [c1]Ilan Bar-On, Ophir Munk:
A New Parallel Factorization A = DDtBC for Band Symmetric Positive Definite Matrices. CONPAR 1992: 349-354 - 1991
- [j3]Ilan Bar-On:
Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process. Parallel Comput. 17(4-5): 409-417 (1991)
1980 – 1989
- 1988
- [b1]Ilan Bar-On:
Parallel algorithms for band SPD systems of linear equations. New York University, USA, 1988 - 1987
- [j2]Ilan Bar-On:
A practical parallel algorithm for solving band symmetric positive definite systems of linear equations. ACM Trans. Math. Softw. 13(4): 323-332 (1987) - 1985
- [j1]Ilan Bar-On, Uzi Vishkin:
Optimal Parallel Generation of a Computation Tree Form. ACM Trans. Program. Lang. Syst. 7(2): 348-357 (1985)
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 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
