Sciweavers

    915 search results - page 5 / 183
    » Convergence of Iterations
    Sort
    View
    RE
    2002
    Springer
    113views Software Engineering» more  RE 2002»
    Converging on the Optimal Attainment of Requirements
    13 years 7 months ago
    Converging on the Optimal Attainment of Requirements
    Download  menzies.us
    Planning for the optimal attainment of requirements is an important early lifecycle activity. However, such planning is difficult when dealing with competing requirements, limited...
    Martin S. Feather, Tim Menzies
    claim paper
    Read More »
    NA
    2011
    373views Computer Vision» more  NA 2011»
    On preconditioned MHSS iteration methods for complex symmetric linear systems
    13 years 2 months ago
    On preconditioned MHSS iteration methods for complex symmetric linear systems
    Download  www.mathcs.emory.edu
    We propose a preconditioned variant of the modified HSS (MHSS) iteration method for solving a class of complex symmetric systems of linear equations. Under suitable conditions, w...
    Zhong-Zhi Bai, Michele Benzi, Fang Chen
    claim paper
    Read More »
    SIAMSC
    2008
    165views more  SIAMSC 2008»
    Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
    13 years 7 months ago
    Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
    Download  www.math.uni-bremen.de
    Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
    Kristian Bredies, Dirk A. Lorenz
    claim paper
    Read More »
    ORL
    1998
    130views more  ORL 1998»
    Accelerating convergence in the Fermat-Weber location problem
    13 years 7 months ago
    Accelerating convergence in the Fermat-Weber location problem
    Download  www.tau.ac.il
    This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
    Jack Brimberg, Reuven Chen, Doron Chen
    claim paper
    Read More »
    STOC
    2007
    ACM
    132views Algorithms» more  STOC 2007»
    On the convergence of Newton's method for monotone systems of polynomial equations
    14 years 7 months ago
    On the convergence of Newton's method for monotone systems of polynomial equations
    Download  www7.informatik.tu-muenchen.de
    Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
    Stefan Kiefer, Michael Luttenberger, Javier Esparz...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.