default search action
Milan B. Tasic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j15]Nahier Aldhafeeri
, Dimitrios Pappas
Representations of generalized inverses via full-rank QDR decomposition. Numer. Algorithms 86(3): 1327-1337 (2021)
2010 – 2019
- 2012
- [j14]Ivan P. Stanimirovic
Computation of generalized inverses by using the LDL* decomposition. Appl. Math. Lett. 25(3): 526-531 (2012) - 2011
- [j13]Marko D. Petkovic, Milan B. Tasic
Effective partitioning method for computing generalized inverses and their gradients. Appl. Math. Comput. 217(19): 7588-7598 (2011) - [j12]Milan B. Tasic
Computation of generalized inverses using PHP/MySQL environment. Int. J. Comput. Math. 88(11): 2429-2446 (2011) - [i5]Marko D. Petkovic, Predrag S. Stanimirovic, Milan B. Tasic:
Effective partitioning method for computing weighted Moore-Penrose inverse. CoRR abs/1104.1690 (2011) - [i4]Milan B. Tasic, Predrag S. Stanimirovic, Marko D. Petkovic:
Symbolic computation of weighted Moore-Penrose inverse using partitioning method. CoRR abs/1104.1696 (2011) - [i3]Predrag S. Stanimirovic, Milan B. Tasic:
Computing generalized inverses using LU factorization of matrix product. CoRR abs/1104.1697 (2011) - [i2]Milan B. Tasic, Predrag S. Stanimirovic, Selver H. Pepic:
About the generalized LM-inverse and the weighted Moore-Penrose inverse. CoRR abs/1104.1698 (2011) - [i1]Milan B. Tasic, Predrag S. Stanimirovic, Selver H. Pepic:
Computation of generalized inverses using Php/MySql environment. CoRR abs/1111.5548 (2011) - 2010
- [j11]Milan B. Tasic
About the generalized LM-inverse and the weighted Moore-Penrose inverse. Appl. Math. Comput. 216(1): 114-124 (2010) - [j10]Milan B. Tasic
Differentiation of generalized inverses for rational and polynomial matrices. Appl. Math. Comput. 216(7): 2092-2106 (2010)
2000 – 2009
- 2009
- [j9]Predrag S. Stanimirovic
Extensions of Faddeev's algorithms to polynomial matrices. Appl. Math. Comput. 214(1): 246-258 (2009) - [j8]Milan B. Tasic, Marko D. Petkovic, Dragan Stevanovic
Perfect state transfer in integral circulant graphs. Appl. Math. Lett. 22(7): 1117-1121 (2009) - [j7]Milan B. Tasic, Marko D. Petkovic:
Some classes of integral circulant graphs either allowing or not allowing perfect state transfer. Appl. Math. Lett. 22(10): 1609-1615 (2009) - 2008
- [j6]Milan B. Tasic
Symbolic and recursive computation of different types of generalized inverses. Appl. Math. Comput. 199(1): 349-367 (2008) - [j5]Marko D. Petkovic, Predrag S. Stanimirovic
Effective partitioning method for computing weighted Moore-Penrose inverse. Comput. Math. Appl. 55(8): 1720-1734 (2008) - [j4]Predrag S. Stanimirovic
Computing generalized inverses using LU factorization of matrix product. Int. J. Comput. Math. 85(12): 1865-1878 (2008) - 2007
- [j3]Milan B. Tasic
Symbolic computation of weighted Moore-Penrose inverse using partitioning method. Appl. Math. Comput. 189(1): 615-640 (2007) - 2004
- [j2]Predrag S. Stanimirovic
Partitioning method for rational and polynomial matrices. Appl. Math. Comput. 155(1): 137-163 (2004) - 2003
- [j1]Predrag S. Stanimirovic
A problem in computation of pseudoinverses. Appl. Math. Comput. 135(2-3): 443-469 (2003)
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:24 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: