Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 46 (1985), S. 31-42 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65 F 10 ; 65 F 35 ; CR: G.1.3
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary LetA be ann×n real symmetric diagonal dominant matrix with positive diagonal partD, and letS 2=D −1 andH=SAS. The following relation between the condition number κ(H)=‖H −1‖ ‖H‖ and the spectral radiusr of the Jacobi matrix associated toA is proved: $$(\kappa (H) - 1)/(\kappa (H) + 1) \leqq r \leqq (\kappa (H) - 1)/(1 + \kappa (H)/(n - 1)).$$ Moreover, relations among κ(H), κ(A), the condition numbersC(H)=‖|H −1| |H|‖, andC(A) are investigated.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Human genetics 〈Berlin〉 62 (1982), S. 225-227 
    ISSN: 1432-1203
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Medicine
    Notes: Summary In a 30-year-old azoospermic male, chromosome analysis revealed an apparently balanced Y-autosome reciprocal translocation, t(Y;6)(Yp6p;Yq6q). Testicular biopsy showed an arrest of spermatogenesis at the First metaphase stage of the meiosis, associated with a considerable desquamation of the germinal epithelium. Meiotic studies showed abnormalities of the sex vesicle at the pachytene stage, and the formation of a chain tetravalent at the diakinesis-metaphase I stage. Possible correlations between the translocation and the defects of spermatogenesis are discussed.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 1432-2277
    Keywords: Neurotoxicity, liver transplantation, cyclosporin ; Liver transplantation, neurotoxicity, cyclosporin ; Cyclosporin, neurotoxicity, liver transplantation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract Neurological complications of cyclosporin (CyA) therapy are frequent, usually occurring within the 1st month after transplantation. Though leukoencephalopathy is one of them, it is rarely documented. Here we report the case of an anti-HCV-positive patient with cirrhosis who underwent liver transplantation and developed cyclosporin-induced leukoencephalopathy. The presenting symptoms were dysarthria, difficulty walking, and dysphagia. They were first noted 6 months after transplantation in association with an episode of recurrent HCV acute hepatitis. White matter abnormalities were evident on computed tomography (CT) scanning and magnetic resonance (MR) imaging. This condition improved to some degree after cyclosporin withdrawal. To our knowledge this is the second reported case of CyA neurotoxicity occurring late after liver transplantation. Moreover, the association with acute hepatitis suggests the possibility of graft dysfunction as a contributing and triggering factor.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 20 (1999), S. 63-73 
    ISSN: 1572-9265
    Keywords: bracketing methods ; bisection ; convergence ; 65H05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The computational cost of a bracketing algorithm in the bit model of computation is analyzed, when working with a finite arithmetic of unbounded accuracy. The complexity measure used here is the number of bit operations, seen as a function of the required absolute error of the result. In this model the convergence of the classical bisection method (as well as that of any bracketing method which requires the function sign) is not ensured when no information on the behaviour of the function is available. A modified bisection algorithm with guaranteed convergence is proposed and an upper bound to its computational cost is given.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 24 (2000), S. 255-274 
    ISSN: 1572-9265
    Keywords: complexity and performance of numerical algorithms ; elementary functions ; 65Y20
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The computational cost, in the bit model of computation, of the evaluation of a real function $$f(x)$$ in a point $$x$$ is analyzed, when the number d of correct digits of the result increases asymptotically. We want to study how the cost depends on $$x$$ also when $$x$$ approaches a critical point for the function f. We investigate the hypotheses under which it is possible to give upper bounds on the cost as functions of “separated variables” d and $$x$$ , that is as products of two functions, each of one variable. We examine in particular the case of elementary functions.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...