compendia types: Published Papers(130) Journal or Magazine Articles(44) Working Papers(1) Problem Sets(1) Books(1)

research fields: Computer and Information Sciences(175) Statistics(2) Econometrics(2)

1 through 25 of 272 results

Jan Waller, Wilhelm Hasselbring

Application-level monitoring frameworks, such as Kieker, provide insight into the inner workings and the dynamic behavior of software systems. However, depending on the number of monitoring probes used, these frameworks may introduce significant runtime overhead. Consequently, planning the instrumentation of continuously operating software systems requires detailed knowledge of the performance impact of each monitoring probe. In this paper, we present our benchmark engineering approach to quantify the monitoring overhead caused by each probe under controlled and repeatable conditions. Our developed MooBench benchmark provides a basis for performance evaluations and comparisons of application-level monitoring frameworks. To evaluate its capabilities, we employ ...

Details

F1000Research

Daniel A. Beard, Klas H. Pettersen, Brian E. Carlson, Stig W. Omholt, Scott M. Bugenhagen

The asserted dominant role of the kidneys in the chronic regulation of blood pressure and in the etiology of hypertension has been debated since the 1970s. At the center of the theory is the observation that the acute relationships between arterial pressure and urine production—the acute pressure-diuresis and pressure-natriuresis curves—physiologically adapt to perturbations in pressure and/or changes in the rate of salt and volume intake. These adaptations, modulated by various interacting neurohumoral mechanisms, result in chronic relationships between water and salt excretion and pressure that are much steeper than the acute relationships. While the view that renal function is the ...

Details

IEEE Transactions on Signal Processing (2013)

Robert Calderbank, Waheed U. Bajwa, Andrew Harms

The code can be used to reproduce the simulations presented in the associated paper or to run similar simulations. The code uses SpaRSA to calculate the Lasso solution and YALL1 to calculate the basis pursuit solution to finding spectral coefficients.

Details

IRMAR-INSA and CREST ENSAI (2010)

Valentin Patilea

The code provides Wald tests results for testing linear Granger causality in mean in the framework of VAR models with non constant variance. A summary on bandwidth selection and the minimum eigenvalues of the estimated volatilities is displayed. The series have to be centered before proceeding to the tests. Note that the adequacy of the VAR model has to be tested before using the modified portmanteau tests available on this companion website.

Details

Journal of Econometrics (2010)

John W. Galbraith, Dongming Zhu

This code estimates the parameters of an AST-NGARCH(1,1) model, which is a non-linear asymmetric NGARCH process of Engle and Ng where the conditional distribution of return is the Asymmetric Student-t distribution (AST) proposed by Zhu and Galbraith.

Details

PLoS ONE

Tom D. Breeze, Bernard E. Vaissière, Riccardo Bommarco, Theodora Petanidou, Nicos Seraphides, Lajos Kozák, Jeroen Scheper, Jacobus C. Biesmeijer, David Kleijn, Steen Gyldenkærne, Marco Moretti, Andrea Holzschuh, Ingolf Steffan-Dewenter, Jane C. Stout, Meelis Pärtel, Martin Zobel, Simon G. Potts, Gen Hua Yue

Declines in insect pollinators across Europe have raised concerns about the supply of pollination services to agriculture. Simultaneously, EU agricultural and biofuel policies have encouraged substantial growth in the cultivated area of insect pollinated crops across the continent. Using data from 41 European countries, this study demonstrates that the recommended number of honeybees required to provide crop pollination across Europe has risen 4.9 times as fast as honeybee stocks between 2005 and 2010. Consequently, honeybee stocks were insufficient to supply >90% of demands in 22 countries studied. These findings raise concerns about the capacity of many countries to cope with ...

Details

ACM Transactions on Mathematical Software

Timothy A. Davis

An ANSI C code for sparse LU factorization is presented that combines a column pre-ordering strategy with a right-looking unsymmetric-pattern multifrontal numerical factorization. The pre-ordering and symbolic analysis phase computes an upper bound on fill-in, work, and memory usage during the subsequent numerical factorization. User-callable routines are provided for ordering and analyzing a sparse matrix, computing the numerical factorization, solving a system with the LU factors, transposing and permuting a sparse matrix, and converting between sparse matrix representations. The simple user interface shields the user from the details of the complex sparse factorization data structures by returning simple handles to ...

Details

ACM Transactions on Mathematical Software

Patrick R. Amestoy, Enseeiht-Irit, Timothy A. Davis, Iain S. Duff

AMD is a set of routines that implements the approximate minimum degree ordering algorithm to permute sparse matrices prior to numerical factorization. There are versions written in both C and Fortran 77. A MATLAB interface is included.

Details

ACM Transactions on Mathematical Software

Robert C. Kirby

Much of finite element computation is constrained by the difficulty of evaluating high-order nodal basis functions. While most codes rely on explicit formulae for these basis functions, we present a new approach that allows us to construct a general class of finite element basis functions from orthonormal polynomials and evaluate and differentiate them at any points. This approach relies on fundamental ideas from linear algebra and is implemented in Python using several object-oriented and functional programming techniques.

Details

Journal ACM Transactions on Mathematical Software (TOMS)

Valérie Frayssé, Luc Giraud, Serge Gratton, Julien Langou

In this article we describe our implementations of the GMRES algorithm for both real and complex, single and double precision arithmetics suitable for serial, shared memory and distributed memory computers. For the sake of portability, simplicity, flexibility and efficiency the GMRES solvers have been implemented in Fortran 77 using the reverse communication mechanism for the matrix-vector product, the preconditioning and the dot product computations. For distributed memory computation, several orthogonalization procedures have been implemented to reduce the cost of the dot product calculation, which is a well-known bottleneck of efficiency for the Krylov methods. Either implicit or explicit calculation of ...

Details

Journal ACM Transactions on Mathematical Software (TOMS)

Tobin A. Driscoll

The Schwarz--Christoffel Toolbox (SC Toolbox) for MATLAB, first released in 1994, made possible the interactive creation and visualization of conformal maps to regions bounded by polygons. The most recent release supports new features, including an object-oriented command-line interface model, new algorithms for multiply elongated and multiple-sheeted regions, and a module for solving Laplace's equation on a polygon with Dirichlet and homogeneous Neumann conditions. Brief examples are given to demonstrate the new capabilities.

Details

Journal ACM Transactions on Mathematical Software (TOMS)

Michael W. Berry, Shakhina A. Pulatova, G. W. Stewart

In many applications---latent semantic indexing, for example---it is required to obtain a reduced rank approximation to a sparse matrix A. Unfortunately, the approximations based on traditional decompositions, like the singular value and QR decompositions, are not in general sparse. Stewart [(1999), 313--323] has shown how to use a variant of the classical Gram--Schmidt algorithm, called the quasi--Gram-Schmidt--algorithm, to obtain two kinds of low-rank approximations. The first, the SPQR, approximation, is a pivoted, Q-less QR approximation of the form (XR11−1)(R11 R12), where X consists of columns of A. The second, the SCR approximation, is of the form the form A ≅ ...

Details

Journal ACM Transactions on Mathematical Software (TOMS)

James H. Money, Qiang Ye

eigifp is a MATLAB program for computing a few extreme eigenvalues and eigenvectors of the large symmetric generalized eigenvalue problem Ax = λ Bx. It is a black-box implementation of an inverse free preconditioned Krylov subspace projection method developed by Golub and Ye [2002]. It has important features that allow it to solve some difficult problems without any input from users. It is particularly suitable for problems where preconditioning by the standard shift-and-invert transformation is not feasible.

Details

Journal ACM Transactions on Mathematical Software (TOMS)

Tangan Gao, T. Y. Li, Mengnien Wu

MixedVol is a C++ software package that computes the mixed volume of n finite subsets of ℤn or the support of a system of n polynomials in n variables. The software produces the mixed volume as well as the mixed cells. The mixed cells are crucial for solving polynomial systems by the polyhedral homotopy continuation method. The software leads existing codes for mixed-volume computation in speed by a substantial margin and its memory requirement is very low.

Details

Journal ACM Transactions on Mathematical Software (TOMS)

Andreas Klimke, Barbara Wohlmuth

To recover or approximate smooth multivariate functions, sparse grids are superior to full grids due to a significant reduction of the required support nodes. The order of the convergence rate in the maximum norm is preserved up to a logarithmic factor. We describe three possible piecewise multilinear hierarchical interpolation schemes in detail and conduct a numerical comparison. Furthermore, we document the features of our sparse grid interpolation software package spinterp for MATLAB.

Details

Journal ACM Transactions on Mathematical Software (TOMS)

Spencer Shellman, K. Sikorski

We present the PFix algorithm for approximating a fixed point of a function f that has arbitrary dimensionality, is defined on a rectangular domain, and is Lipschitz continuous with respect to the infinity norm with constant 1. PFix has applications in economics, game theory, and the solution of partial differential equations. PFix computes an approximation that satisfies the residual error criterion, and can also compute an approximation satisfying the absolute error criterion when the Lipschitz constant is less than 1. For functions defined on all rectangular domains, the worst-case complexity of PFix has order equal to the logarithm of the ...

Details

ACM Transactions on Mathematical Software

Timothy A. Davis

The LDL software package is a set of short, concise routines for factorizing symmetric positive-definite sparse matrices, with some applicability to symmetric indefinite matrices. Its primary purpose is to illustrate much of the basic theory of sparse matrix algorithms in as concise a code as possible, including an elegant method of sparse symmetric factorization that computes the factorization row-by-row but stores it column-by-column. The entire symbolic and numeric factorization consists of less than 50 executable lines of code. The package is written in C, and includes a MATLAB interface.

Details

ACM Transactions on Mathematical Software

Amparo Gil, Javier Segura, Nico M. Temme

Fortran 90 programs for the computation of real parabolic cylinder functions are presented. The code computes the functions U(a, x), V(a, x) and their derivatives for real a and x (x ≥ 0). The code also computes scaled functions. The range of computation for scaled PCFs is practically unrestricted. The aimed relative accuracy for scaled functions is better than 5 10−14. Exceptions to this accuracy are the evaluation of the functions near their zeros and the error caused by the evaluation of trigonometric functions of large arguments when |a| ≫ x. The routines always give values for which the Wronskian ...

Details

ACM Transactions on Mathematical Software

William W. Hager, Hongchao Zhang

Recently, a new nonlinear conjugate gradient scheme was developed which satisfies the descent condition gTkdk ≤ −7/8 ‖gk‖2 and which is globally convergent whenever the line search fulfills the Wolfe conditions. This article studies the convergence behavior of the algorithm; extensive numerical tests and comparisons with other methods for large-scale unconstrained optimization are given.

Details

ACM Transactions on Mathematical Software

Laurent Granvilliers, Frédéric Benhamou

RealPaver is an interval software for modeling and solving nonlinear systems. Reliable approximations of continuous or discrete solution sets are computed using Cartesian products of intervals. Systems are given by sets of equations or inequality constraints over integer and real variables. Moreover, they may have different natures, being square or nonsquare, sparse or dense, linear, polynomial, or involving transcendental functions.The modeling language permits stating constraint models and tuning parameters of solving algorithms which efficiently combine interval methods and constraint satisfaction techniques. Several consistency techniques (box, hull, and 3B) are implemented. The distribution includes C sources, executables for different machine architectures, ...

Details

ACM Transactions on Mathematical Software

Leslie Foster, Rajesh Kommu

Existing routines, such as xGELSY or xGELSD in LAPACK, for solving rank-deficient least squares problems require O(mn2) operations to solve min ‖b − Ax‖ where A is an m by n matrix. We present a modification of the LAPACK routine xGELSY that requires O(mnk) operations where k is the effective numerical rank of the matrix A. For low rank matrices the modification is an order of magnitude faster than the LAPACK code.

Details

ACM Transactions on Mathematical Software

Peter Benner, Daniel Kressner

This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamiltonian matrices. The implemented algorithms are based on orthogonal symplectic decompositions, implying numerical backward stability as well as symmetry preservation for the computed eigenvalues. These algorithms are supplemented with balancing and block algorithms which can lead to considerable accuracy and performance improvements. As a by-product, an efficient implementation for computing symplectic QR decompositions is provided. We demonstrate the usefulness of the subroutines for several, practically relevant examples.

Details

ACM Transactions on Mathematical Software

Fayez A. Alhargan

A continued fraction function algorithm is developed to evaluate general-order Mathieu characteristic numbers, and a new technique is presented for evaluating the Mathieu determinant which can be used to compute the order directly. Approximate expressions are developed to estimate the orders and Mathieu characteristic numbers for the root, finding algorithms. The algorithms, with minor modifications, were used for computing Mathieu coefficients of general order. The algorithms can deal with a large range of Mathieu characteristic number c, real and complex order ν, and parameter h.

Details

ACM Transactions on Mathematical Software

Genetha A. Gray, Tamara G. Kolda

APPSPACK is software for solving unconstrained and bound-constrained optimization problems. It implements an asynchronous parallel pattern search method that has been specifically designed for problems characterized by expensive function evaluations. Using APPSPACK to solve optimization problems has several advantages: No derivative information is needed; the procedure for evaluating the objective function can be executed via a separate program or script; the code can be run serially or in parallel, regardless of whether the function evaluation itself is parallel; and the software is freely available. We describe the underlying algorithm, data structures, and features of APPSPACK version 4.0, as well as ...

Details

ACM Transactions on Mathematical Software

Hai-Jun Su, J. Michael McCarthy, Masha Sosonkina, Layne T. Watson

Globally convergent, probability-one homotopy methods have proven to be very effective for finding all the isolated solutions to polynomial systems of equations. After many years of development, homotopy path trackers based on probability-one homotopy methods are reliable and fast. Now, theoretical advances reducing the number of homotopy paths that must be tracked and handling singular solutions have made probability-one homotopy methods even more practical. POLSYS_GLP consists of Fortran 95 modules for finding all isolated solutions of a complex coefficient polynomial system of equations. The package is intended to be used on a distributed memory multiprocessor in conjunction with HOMPACK90 (Algorithm ...

Details
1 through 25 of 272 results