default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMilan D. Mihajlovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j8]David Shepherd, James Miles, Matthias Heil, Milan D. Mihajlovic
:
An Adaptive Step Implicit Midpoint Rule for the Time Integration of Newton's Linearisations of Non-Linear Problems with Applications in Micromagnetics. J. Sci. Comput. 80(2): 1058-1082 (2019)- 2016
- [j7]Jennifer Pestana, Richard L. Muddle, Matthias Heil, Françoise Tisseur, Milan D. Mihajlovic:
Efficient Block Preconditioning for a C1 Finite Element Discretization of the Dirichlet Biharmonic Problem. SIAM J. Sci. Comput. 38(1) (2016) - 2012
- [j6]Richard L. Muddle, Milan D. Mihajlovic, Matthias Heil:
An efficient preconditioner for monolithically-coupled large-displacement fluid-structure interaction problems with pseudo-solid mesh updates. J. Comput. Phys. 231(21): 7315-7334 (2012) - 2011
- [j5]Howard C. Elman, Milan D. Mihajlovic, David J. Silvester:
Fast iterative solvers for buoyancy driven flow problems. J. Comput. Phys. 230(10): 3900-3914 (2011)
2000 – 2009
- 2008
- [p1]Slobodan Z. Mijalkovic, Milan D. Mihajlovic:
Multigrid Methods. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j4]A. N. F. Klimowicz, Milan D. Mihajlovic:
Modelling 3D semi-deformable tubes in real time. Appl. Math. Comput. 184(1): 52-62 (2007) - 2006
- [c4]A. N. F. Klimowicz, Milan D. Mihajlovic, Matthias Heil:
Deployment of Parallel Direct Sparse Linear Solvers within a Parallel Finite Element Code. Parallel and Distributed Computing and Networks 2006: 310-315 - 2004
- [j3]Milan D. Mihajlovic, David J. Silvester:
Efficient parallel solvers for the biharmonic equation. Parallel Comput. 30(1): 35-55 (2004) - [c3]Milan D. Mihajlovic, Slobodan Mijalkovic:
Efficiency Study of the "Black-Box" Component Decomposition Preconditioning for Discrete Stress Analysis Problems. International Conference on Computational Science 2004: 97-104 - 2002
- [j2]Milan D. Mihajlovic, Slobodan Mijalkovic:
A component decomposition preconditioning for 3D stress analysis problems. Numer. Linear Algebra Appl. 9(6-7): 567-583 (2002) - 2001
- [c2]Michael K. Bane, Milan D. Mihajlovic:
A fast parallel solver for the biharmonic problem. PP 2001
1990 – 1999
- 1996
- [j1]Emina I. Milovanovic, Igor Z. Milovanovic, Mile K. Stojcev, Milan D. Mihajlovic:
An Optimal Algorithm for Gaussian Elimination of Band Matrices on a MIMD System. Comput. Artif. Intell. 15(5): 467-481 (1996) - 1994
- [c1]Mile K. Stojcev, Emina I. Milovanovic, Milan D. Mihajlovic, Igor Z. Milovanovic:
Parallel Algorithm for Inverting Tridiagonal Matrix on Linear Processor Array. CONPAR 1994: 229-240
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:27 CEST 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:
