default search action
Jiri Rohn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j37]Jiri Rohn:
Verification of Linear (In)Dependence in Finite Precision Arithmetic. Math. Comput. Sci. 8(3-4): 323-328 (2014) - [j36]Jiri Rohn, Vahideh Hooshyarbakhsh, Raena Farhadsefat:
An iterative method for solving absolute value equations and sufficient conditions for unique solvability. Optim. Lett. 8(1): 35-44 (2014) - [j35]Jiri Rohn:
A Farkas-type theorem for interval linear inequalities. Optim. Lett. 8(4): 1591-1598 (2014) - 2012
- [j34]Jiri Rohn:
A theorem of the alternatives for the equation |Ax| - |B||x| = b. Optim. Lett. 6(3): 585-591 (2012) - [j33]Jiri Rohn:
A note on generating P-matrices. Optim. Lett. 6(3): 601-603 (2012) - [j32]Jiri Rohn:
A general method for enclosing solutions of interval linear equations. Optim. Lett. 6(4): 709-717 (2012) - [j31]Jiri Rohn:
An algorithm for computing all solutions of an absolute value equation. Optim. Lett. 6(5): 851-856 (2012) - [j30]Jiri Rohn:
On Rump's characterization of P-matrices. Optim. Lett. 6(5): 1017-1020 (2012) - 2010
- [j29]Jiri Rohn:
A residual existence theorem for linear equations. Optim. Lett. 4(2): 287-292 (2010)
2000 – 2009
- 2009
- [j28]Jiri Rohn:
On unique solvability of the absolute value equation. Optim. Lett. 3(4): 603-606 (2009) - 2006
- [j27]Jiri Rohn:
Regularity of Interval Matrices and Theorems of the Alternatives. Reliab. Comput. 12(2): 99-105 (2006) - [j26]Jiri Rohn:
Letter to the Editor. Reliab. Comput. 12(3): 245-246 (2006) - 2005
- [j25]Jiri Rohn:
A Normal Form Supplement to the Oettli-Prager Theorem. Reliab. Comput. 11(1): 35-39 (2005) - [j24]Jiri Rohn:
Linear Interval Equations: Midpoint Preconditioning May Produce a 100% Overestimation for Arbitrarily Narrow Data Even in Case n = 4. Reliab. Comput. 11(2): 129-135 (2005) - [j23]Jiri Rohn:
How Strong Is Strong Regularity? Reliab. Comput. 11(6): 491-493 (2005) - 2003
- [j22]Jiri Rohn:
Solvability of Systems of Linear Interval Equations. SIAM J. Matrix Anal. Appl. 25(1): 237-245 (2003) - 2001
- [p1]Götz Alefeld, Jiri Rohn, Siegfried M. Rump, Tetsuro Yamamoto:
Introduction: Symbolic Algebraic Methods and Verification Methods. Symbolic Algebraic Methods and Verification Methods 2001: 1-2 - [e1]Götz Alefeld, Jiri Rohn, Siegfried M. Rump, Tetsuro Yamamoto:
Symbolic Algebraic Methods and Verification Methods. Springer 2001, ISBN 3-211-83593-8 [contents]
1990 – 1999
- 1999
- [j21]Christian Jansson, Jiri Rohn:
An Algorithm for Checking Regularity of Interval Matrices. SIAM J. Matrix Anal. Appl. 20(3): 756-776 (1999) - 1998
- [j20]Günter Mayer, Jiri Rohn:
On the Applicability of the Interval Gaussian Algorithm. Reliab. Comput. 4(3): 205-222 (1998) - [j19]Georg Rex, Jiri Rohn:
Sufficient Conditions for Regularity and Singularity of Interval Matrices. SIAM J. Matrix Anal. Appl. 20(2): 437-445 (1998) - 1997
- [j18]Jiri Rohn:
On Overestimations Produced by the Interval Gaussian Algorithm. Reliab. Comput. 3(4): 363-368 (1997) - 1996
- [j17]Jiri Rohn:
Enclosing solutions of overdetermined systems of linear interval equations. Reliab. Comput. 2(2): 167-171 (1996) - [j16]Jiri Rohn, Georg Rex:
Interval P-Matrices. SIAM J. Matrix Anal. Appl. 17(4): 1020-1024 (1996) - [j15]Jiri Rohn:
An algorithm for checking stability of symmetric interval matrices. IEEE Trans. Autom. Control. 41(1): 133-136 (1996) - 1995
- [j14]Jiri Rohn, Vladik Kreinovich:
Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard. SIAM J. Matrix Anal. Appl. 16(2): 415-420 (1995) - 1994
- [j13]Jiri Rohn:
Enclosing solutions of linear interval equations is NP-hard. Computing 53(3-4): 365-368 (1994) - [j12]Jiri Rohn:
Positive Definiteness and Stability of Interval Matrices. SIAM J. Matrix Anal. Appl. 15(1): 175-184 (1994) - 1993
- [j11]Jiri Rohn:
A step size rule for unconstrained optimization. Computing 49(4): 373-376 (1993) - [j10]Svatopluk Poljak, Jiri Rohn:
Checking robust nonsingularity is NP-hard. Math. Control. Signals Syst. 6(1): 1-9 (1993) - [j9]Jiri Rohn:
A note on solvability of a class of linear complementarity problems. Math. Program. 60: 229-231 (1993) - [j8]Jiri Rohn:
Stability of the optimal basis of a linear program under uncertainty. Oper. Res. Lett. 13(1): 9-12 (1993) - [j7]Jiri Rohn:
Interval Matrices: Singularity and Real Eigenvalues. SIAM J. Matrix Anal. Appl. 14(1): 82-91 (1993) - 1992
- [j6]Jiri Rohn, Assem Deif:
On the range of eigenvalues of an interval matrix. Computing 47(3-4): 373-377 (1992) - 1990
- [j5]Jiri Rohn:
A Short Proof of Finiteness of Murty's Principal Pivoting Algorithm. Math. Program. 46: 255-256 (1990)
1980 – 1989
- 1989
- [j4]Jiri Rohn:
A two-sequence method for linear interval equations. Computing 41(1-2): 137-140 (1989) - [j3]Jiri Rohn:
New condition numbers for matrices and linear systems. Computing 41(1-2): 167-169 (1989) - [j2]Jiri Rohn:
A Farkas-type theorem for linear interval equations. Computing 43(1): 93-95 (1989) - 1985
- [c1]Jiri Rohn:
Inner Solutions of Linear Interval Systems. Interval Mathematics 1985: 157-158 - 1981
- [j1]Jiri Rohn:
Strong solvability of interval linear programming problems. Computing 26(1): 79-82 (1981)
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-04-25 05:50 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: