Rice Univesrity Logo
    • FAQ
    • Deposit your work
    • Login
    Search 
    •   Rice Scholarship Home
    • Faculty & Staff Research
    • George R. Brown School of Engineering
    • Computational and Applied Mathematics
    • CAAM Technical Reports
    • Search
    •   Rice Scholarship Home
    • Faculty & Staff Research
    • George R. Brown School of Engineering
    • Computational and Applied Mathematics
    • CAAM Technical Reports
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 21-30 of 209

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    Thumbnail

    Path-Following Methods for a Class of Constrained Minimization Problems in Function Space 

    Hintermüller, M.; Kunisch, K. (2004-07)
    Path-following methods for primal-dual active set strategies requiring a regularization parameter are introduced. Existence of a path and its differentiability properties are analyzed. Monotonicity and convexity of the ...
    Thumbnail

    A Linear-Time Algorithm for Solving the Molecular Distance Geometry Problem with Exact Inter-Atomic Distances 

    Dong, Qunfeng; Wu, Zhijun (2001-06)
    We describe a linear-time algorithm for solving the molecular distance geometry problem with exact distances between all pairs of atoms. This problem needs to be solved in every iteration of general distance geometry ...
    Thumbnail

    A Study on Conditions for Sparse Solution Recovery in Compressive Sensing 

    Eydelzon, Anatoly (2007-08)
    It is well-known by now that under suitable conditions L1 minimization can recover sparse solutions to under-determined linear systems of equations. More precisely, by solving the convex optimization problem min{||x||1 : ...
    Thumbnail

    Maximum Stable Set Formulations and Heuristics Based on Continuous Optimization 

    Burer, Samuel; Monteiro, Renato; Zhang, Yin (2000-12)
    The stability number for a given graph G is the size of a maximum stable set in G. The Lovasz theta number provides an upper bound on the stability number and can be computed as the optimal value of the Lovasz semidefinite ...
    Thumbnail

    The Arnoldi Eigenvalue Iteration with Exact Shifts Can Fail 

    Embree, Mark (2006-09)
    The restarted Arnoldi algorithm, implemented in the ARPACK software library and MATLAB's eigs command, is among the most common means of computing select eigenvalues and eigenvectors of a large, sparse matrix. To assist ...
    Thumbnail

    Programming the Nanocell, a Random Array of Molecules 

    Husband, Summer M. (2002-05)
    The emerging field of molecular electronics seeks to create computational function from individual molecules or arrays of molecules. These nanoscale devices would then enable the production of faster, denser, cheaper ...
    Thumbnail

    On Eliminating Square Paths in a Square Lattice 

    Williams, Nikki (2000-04)
    Removing the minimum number of vertices or points from a square lattice such that no square path exists is known as the square path problem. Finding this number as the size of the lattice increases is not so trivial. Results ...
    Thumbnail

    A Simple Proof for Recoverability of L1-Minimization: Go Over or Under? 

    Zhang, Yin (2005-08)
    It is well-known by now that L1 minimization can help recover sparse solutions to under-determined linear equations or sparsely corrupted solutions to over-determined equations, and the two problems are equivalent under ...
    Thumbnail

    Software Design for Simulation Driven Optimization 

    Padula, Anthony D. (2005-10)
    This thesis describes a flexible framework for abstract numerical algorithms which treats algorithms as objects and makes them reusable, composable, and modifiable. These algorithm objects are implemented using the Rice ...
    Thumbnail

    Fixed-Polynomial Approximate Spectral Transformations for Preconditioning the Eigenvalue Problem 

    Thornquist, Heidi Krista (2003-06)
    Arnoldi's method is often used to compute a few eigenvalues and eigenvectors of large, sparse matrices. When the eigenvalues of interest are not dominant or well-separated, this method may suffer from slow convergence. ...
    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • . . .
    • 21

    Home | FAQ | Contact Us
    Managed by the Digital Scholarship Services at Fondren Library, Rice University
    Physical Address: 6100 Main Street, Houston, Texas 77005
    Mailing Address: MS-44, P.O.BOX 1892, Houston, Texas 77251-1892
     

     

    Browse

    Entire ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsType

    My Account

    Login

    Context

    Export Search Metadata

    Discover

    AuthorZhang, Yin (32)Dennis, J.E. Jr. (18)Symes, William W. (17)Sorensen, D.C. (16)Yin, Wotao (14)Abramson, Mark A. (11)Audet, Charles (10)Sorensen, Danny C. (10)Calderon, Christopher P. (9)Antoulas, A.C. (7)... View MoreDate Issued2009 (35)2000 (30)2008 (25)2006 (20)2001 (19)2004 (18)2003 (17)2007 (16)2002 (15)2005 (14)Has File(s)Yes (209)

    Home | FAQ | Contact Us
    Managed by the Digital Scholarship Services at Fondren Library, Rice University
    Physical Address: 6100 Main Street, Houston, Texas 77005
    Mailing Address: MS-44, P.O.BOX 1892, Houston, Texas 77251-1892