Author image not provided
 Daniela Calvetti

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.64
Citation Count153
Publication count33
Publication years1992-2012
Available for download1
Average downloads per article1,130.00
Downloads (cumulative)1,130
Downloads (12 Months)30
Downloads (6 Weeks)1
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Advisor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


33 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 33
Result page: 1 2

Sort by:

1
December 2012
Bibliometrics:
Citation Count: 0

Interesting, real-world mathematical modeling problems are complex and can usually be studied at different scales. The scale at which the investigation is carried out is one of the factors that determines the type of mathematics most appropriate to describe the problem. This book concentrates on two modeling paradigms: the macroscopic, ...

2
February 2010 Computer Methods and Programs in Biomedicine: Volume 97 Issue 2, February, 2010
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 1

Steady state flux balance analysis (FBA) for cellular metabolism is used, e.g., to seek information on the activity of the different pathways under equilibrium conditions, or as a basis for kinetic models. In metabolic models, the stoichiometry of the system, commonly completed with bounds on some of the variables, is ...
Keywords: Markov Chain Monte Carlo, Steady state, Cellular metabolism, Bayesian, Flux balance analysis

3
September 2009 SIAM Journal on Imaging Sciences: Volume 2 Issue 3, July 2009
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0

Bayesian modeling and analysis of the magnetoencephalography and electroencephalography modalities provide a flexible framework for introducing prior information complementary to the measured data. This prior information is often qualitative in nature, making the translation of the available information into a computational model a challenging task. We propose a generalized gamma ...
Keywords: Markov chain Monte Carlo, electroencephalography/magnetoencephalography, finite element methods

4

5
August 2007 Computers in Biology and Medicine: Volume 37 Issue 8, August, 2007
Publisher: Pergamon Press, Inc.
Bibliometrics:
Citation Count: 3

An efficient computational method for near real-time simulation of thermal ablation of tumors via radio frequencies is proposed. Model simulations of the temperature field in a 3D portion of tissue containing the tumoral mass for different patterns of source heating can be used to design the ablation procedure. The availability ...
Keywords: Coagulative necrosis, Modelling, Fast solver for time-dependent PDEs, Radio frequency ablation

6
March 2007 Computer Methods and Programs in Biomedicine: Volume 85 Issue 3, March, 2007
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

The reconstruction of an unknown input function from noisy measurements in a biological system is an ill-posed inverse problem. Any computational algorithm for its solution must use some kind of regularization technique to neutralize the disastrous effects of amplified noise components on the computed solution. In this paper, following a ...
Keywords: Bayesian inversion, Deconvolution, Monte Carlo simulation, Muscle oxygen uptake, Oxygen transport and metabolism, Mitochondrial oxygen consumption

7
January 2007 Journal of Computational and Applied Mathematics - Special issue: Applied computational inverse problems: Volume 198 Issue 2, 15 January 2007
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

In this paper we revisit the solution of ill-posed problems by preconditioned iterative methods from a Bayesian statistical inversion perspective. After a brief review of the most popular Krylov subspace iterative methods for the solution of linear discrete ill-posed problems and some basic statistics results, we analyze the statistical meaning ...
Keywords: Bayesian inversion, preconditioners, Krylov subspace, ill-posed problems, iterative solvers

8
July 2005 Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing: Volume 54 Issue 2, July 2005
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 3

The solution of large linear discrete ill-posed problems by iterative methods has recently received considerable attention. This paper presents invertible smoothing preconditioners which are well suited for use with the GMRES, RRGMRES and LSQR methods.
Keywords: ill-posed problem, iterative method, GMRES, LSQR, RRGMRES, preconditioning

9
July 2005 Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing: Volume 54 Issue 2, July 2005
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 5

The solution of large linear discrete ill-posed problems by iterative methods has recently received considerable attention. This paper presents invertible smoothing preconditioners which are well suited for use with the GMRES, RRGMRES and LSQR methods.
Keywords: Ill-posed problem, Iterative method, LSQR, RRGMRES, Preconditioning, GMRES

10
March 2005 SIAM Journal on Matrix Analysis and Applications: Volume 26 Issue 3, 2005
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 2

Applying a few steps of the Arnoldi process to a large nonsymmetric matrix A with initial vector v is shown to induce several quadrature rules. Properties of these rules are discussed, and their application to the computation of inexpensive estimates of the quadratic form < f , g > := ...
Keywords: bilinear form, error estimate, large-scale problem, quadrature method

11
January 2005 SIAM Journal on Scientific Computing: Volume 26 Issue 1, 2005
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 9

Many numerical methods for the solution of linear ill-posed problems apply Tikhonov regularization. This paper presents a modification of a numerical method proposed by Golub and von Matt for quadratically constrained least-squares problems and applies it to Tikhonov regularization of large-scale linear discrete ill-posed problems. The method is based on ...
Keywords: ill-posed problem, regularization, Gauss quadrature

12 published by ACM
September 2003 ACM Transactions on Mathematical Software (TOMS): Volume 29 Issue 3, September 2003
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 1,   Downloads (12 Months): 30,   Downloads (Overall): 1,130

Full text available: PDFPDF
irbleigs is a MATLAB program for computing a few eigenvalues and associated eigenvectors of a sparse Hermitian matrix of large order n . The matrix is accessed only through the evaluation of matrix-vector products. Working space of only a few n -vectors is required. The program implements a restarted block-Lanczos ...
Keywords: Block Lanczos method, eigenvalue computation, generalized eigenproblem, singular values, polynomial acceleration

13
December 2002 Journal of Computational and Applied Mathematics: Volume 149 Issue 2, 15 December 2002
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

The QR-algorithm is a popular numerical method for the computation of eigenvalues of matrices. All eigenvalues of a general n × n upper Hessenberg matrix typically can be computed in O(n 3 ) arithmetic floating point operations using O(n 2 ) storage locations. When the upper Hessenberg matrix is Hermitian ...

14
May 2002 SIAM Journal on Scientific Computing: Volume 24 Issue 5, 2002
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 11

The irbleigs code is an implementation of an implicitly restarted block-Lanczos method for computing a few selected nearby eigenvalues and associated eigenvectors of a large, possibly sparse, Hermitian matrix A . The code requires only the evaluation of matrix-vector products with A ; in particular, factorization of A is not ...
Keywords: block-Lanczos method, singular value computation, eigenvalue computation, polynomial acceleration

15
August 2001 Contemporary mathematics: theory and applications
Publisher: American Mathematical Society
Bibliometrics:
Citation Count: 0

One of the most popular methods for computing the zeros of a polynomial in power form is to determine the eigenvalues of the associated companion matrix. This approach, which commonly is referred to as the companion matrix method, however, can yield poor accuracy. We demonstrate that when approximations of the ...
Keywords: zero-finder, newton polynomial, companion matrix

16
January 2001 Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. V: quadrature and orthogonal polynomials: Volume 127 Issue 1-2, Jan. 15, 2001
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 3

Keywords: conjugate gradient method, symmetric linear system, Gauss quadrature, Lanczos process

17
January 2001 Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. V: quadrature and orthogonal polynomials: Volume 127 Issue 1-2, Jan. 15, 2001
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

Keywords: eigenvalue problem, Szegőo-Hessenberg matrix, parallel computation, companion matrix, continuation method

18
November 2000 Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra: Volume 123 Issue 1-2, Nov. 2000
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 4

Keywords: bordering algorithm, bifurcation point, eigenvalue computation, nonlinear system, path following, turning point

19
November 2000 Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra: Volume 123 Issue 1-2, Nov. 2000
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 21

Keywords: ill-posed problem, regularization, Gauss quadrature, L-curve criterion

20
July 2000 Mathematics of Computation: Volume 69 Issue 231, July 2000
Publisher: American Mathematical Society
Bibliometrics:
Citation Count: 6




The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us