|
| |
| | Delphi method - Wikipedia, the free encyclopedia |
 | | Another particular weakness of the Delphi method is that future developments are not always predicted correctly by iterative consensus of experts, but instead by unconventional thinking of amateur outsiders. | | | Later on, several extensions to the Delphi method were developed to address this problem, such as cross impact analysis, that takes into consideration the possibility that the occurrence of one event may change probabilities of other events covered in the survey. | | | To build consensus, the Delphi method often uses the Hegelian dialectic process of thesis (establishing an opinion or view), antithesis (conflicting opinion or view) and finally synthesis (a new agreement or consensus), with synthesis becoming the new thesis. |
|
http://en.wikipedia.org/wiki/Delphi_method
|
|
| |
| | Overcoming cultural challenges in adopting iterative development |
| | Iterative Development A structured method of planned rework in which the application or system is developed in small increments. | | | Iterative development is a software development paradigm that stresses the importance of executable software as proof of progress. | | | Iterative development is not just an internal process that only the "techies" need to understand. |
|
http://www-106.ibm.com/developerworks/rational/library/content/RationalEdge/oct04/nelson/index.html
(5683 words)
|
|
| |
| | AdaIC Flyers -- Flying Objects: European Air Navigation System Gets Overhaul |
| | At the Eurocontrol Experimental Center south of Paris, developers are working on collision avoidance software and a mathematical simulator using object oriented technology, the Booch method, Rational Rose, and Ada. | | | The primary reasons for selecting an iterative, object oriented approach were maintainability, flexibility, and reusability of the software over its lifetime, which Eurocontrol estimates to be from 12 to 15 years. | | | This method also had to be supported by several tools. |
|
http://archive.adaic.com/docs/flyers/eur-air.html
(465 words)
|
|
| |
| | Dynamic Systems Development Method - Wikipedia, the free encyclopedia |
| | The dynamic systems development method (DSDM) provides a framework for an iterative and incremental approach to the development of Information Systems. | | | The Rational Unified Process is a method that probably has the most in common with DSDM in that it also a dynamic way of Information System Development. | | | It is one of a number of Agile methods for developing software and forms part of the Agile Alliance. |
|
http://en.wikipedia.org/wiki/DSDM
(3329 words)
|
|
| |
| | Computer Science |
| | Need for numerical computation; algorithms and flowcharts; errors in computations; basic methods for the solution of single equations; the simple iterative method; Newton-Raphson method; solution of polynomial equations; interpolation. | | | Introduction to the graphical and descriptive methods of summarizing data, introduction to statistical techniques that are fundamental to the kinds of analysis frequently required in biological research, concept of design of experiments and its importance, some simple experimental designs that are widely used in practice, guidance on choosing an appropriate statistical technique for data analysis. | | | Introduction to programming languages; computer system levels; classification of languages: levels of abstraction; generations of languages; procedural/declarative; object-oriented languages; phases of a compiler; Pascal programming; C programming; comparative study of C and Pascal. |
|
http://www.ou.ac.lk/fac_natural/dpt_maths/BSCdetailsy.html
(1497 words)
|
|
| |
| | Global-Online-Store (Canada) Books - Computers & Internet |
| | As difficult as it may be to believe, the waterfall method is still prevalent despite the large body of literature on rapid, iterative development SDLCs. | | | The simple patterns are easy enough to understand (Factory method and the like) and the complex ones (Visitor) can be digested with the understanding of the basic patterns. | | | His approach of talking to you, the programmer, is ideal: not too much humor, and an easy to read, but professional approach in the way he donates the contents of his brain: i.e. |
|
http://ca.books-online-store.net/case/books/computers-and-internet/1890509.html
(10131 words)
|
|
| |
| | Control Chaos |
| | To learn iterative, incremental development the agile way using Scrum, the next ScrumMaster Certification classes are: | | | All ControlChaos store courses are conducted by Ken Schwaber Attendees will be thoroughly trained in the Scrum methodology and software. | | | Advanced Development Methods, Inc. (ADM) maintains this website to provide information, news, references and a cookbook description of Scrum. |
|
http://www.controlchaos.com
(438 words)
|
|
| |
| | The New Methodology |
| | Scrum also developed in the 80's and 90's primarily with OO development circles as a highly iterative development methodology. | | | Agile methods assert that no process will ever make up the skill of the development team, so the role of a process is to support the development team in their work. | | | Agile methods seek to take advantage of this, encouraging business people to learn about their needs as the system gets built, and to build the system in such a way that changes can be incorporated quickly. |
|
http://www.martinfowler.com/articles/newMethodology.html
(8931 words)
|
|
| |
| | Object Technology Jeff Sutherland: Scrum: Where Did Rapid Application Development Come From? |
| | In his book, Agile and Iterative Development, Larman has well documented the history of the many disasters introduced by accident when the Department of Defense standardized on a non-iterative method that was unproven on large projects. | | | Of particular interest is an article on the history of iterative development, highly recommended for anyone interested in the background Agile methods. | | | The first published paper that Larman could find on iterative development was a 1968 report from Biran Randell and F.W. Zurcher at the IBM T.J. Watson Research Center. |
|
http://jeffsutherland.com/2005/04/scrum-where-did-rapid-application.html
(591 words)
|
|
| |
| | Amazon.co.uk: DSDM: The Method in Practice: Books |
| | It is about truly understanding the needs of a business, delivering software solutions that work and delivering them as quickly and as cheaply as possible.The Dynamic Systems Development Method provides a framework of controls and best practice for Rapid Application Development. | | | Buy DSDM: The Method in Practice with Agile Software Development Ecosystems today! | | | This book, commissioned by the DSDM Consortium and written by the chairman of the Technical Committee which developed the method, explores the day-to-day realities of implementing the method. |
|
http://www.amazon.co.uk/exec/obidos/ASIN/0201178893
(750 words)
|
|
| |
| | Jacobi Method |
| | Next: Gauss-Seidel Method Up: Iterative Methods Previous: Iterative Methods | | | The ``inversion'' is trivial provided the diagonal has no zero elements. | | | Write A = D + L + U, where D is diagonal, L and U are the (strictly) lower and upper triangular parts of A. Consider |
|
http://www.math.buffalo.edu/~pitman/courses/mth437/na2/node11.html
(130 words)
|
|
| |
| | The Delphi Method |
| | We have chosen to use the Delphi method as the group support process. | | | It is an iterative and structured group communication process: | | | The heart of CIS is a group support mechanism. |
|
http://www.cis.uab.edu/info/kdrg/AFCEA/tsld016.html
(130 words)
|
|
| |
| | week12.txt |
| | Iterative nature of the method (SPIRAL MODEL) and the different phases of the method were explained. | | | 2) ANALYSIS OF ARCHITECTURE USING ATAM: A technique for analyzing architecture called "Architecture tradeoff analysis method" (ATAM) developed at SEI was the next subject of discussion. | | | FEEDBACK BY ADVISOR: a) ATAM could potentially be used to analyze HUMS architecture, provided the team develops analysis techniques for attributes crucial to HUMS architecture. |
|
http://www.cs.odu.edu/~hums/minutes_files/week12.txt
(130 words)
|
|
| |
| | enc_sybtech.doc |
| | Iterative Methods: Introduction, starting an iterative method, method of successive bisection, False-position method, Newton Raphson method, Secant method, Successive approximation method, comparison of iterative methods, solution of non-linear equations (By Newton Raphson method) Solution Of Simultaneous Algebraic Equations: Introduction, Gauss-elimination method, pivoting, Gauss-seidel iterative method, comparison of direct and iterative methods. | | | Normal forms: disjunctive normal form, conjunctive normal form, principal disjunctive normal form, principal conjunctive normal form, ordering and uniqueness of normal forms. | | | Predicate calculus: predicates, the statement functions, variables, universal and existential quantifiers, predicate formulas, free and bound variables, the universe of discourse. |
|
http://www.umit.ac.in/matter/enc_sybtech.doc
(2871 words)
|
|
| |
| | List of mathematics-based methods: Encyclopedia topic |
| | Iterative method (numerical analysis (numerical analysis: numerical analysis is the study of algorithms for the problems of continuous mathematics... | | | D'Hondt method (D'Hondt method: the dhondt method is a method for allocating seats in party-list proportional representatio... | | | Method of moving frames (Method of moving frames: in mathematics, the idea of a frame in the theory of smooth manifolds is understood... |
|
http://www.absoluteastronomy.com/reference/list_of_mathematics-based_methods
(1266 words)
|
|
| |
| | Iterative Methods |
| | The term ``iterative method'' refers to a wide range of techniques that use successive approximations to obtain more accurate solutions to a linear system at each step. | | | The rate at which an iterative method converges depends greatly on the spectrum of the coefficient matrix. | | | Nonstationary iterative method: Iterative method that has iteration-dependent coefficients. |
|
http://netlib2.cs.utk.edu/linalg/html_templates/node9.html
(292 words)
|
|
| |
| | BibTeX bibliography /home/higham/narep/u-manchester-mccm.bib |
| | The method is particularly attractive for shared memory parallel computers with a relatively small number of processors, because the polar decomposition can be computed efficiently on such machines using an iterative method developed recently by the authors. | | | This iterative polar decomposition method requires only matrix multiplication and matrix inversion kernels for its implementation and is designed for full rank matrices; thus the proposed SVD method is intended for matrices that are not too close to being rank-deficient. | | | The stability of four of them is analysed here: a fan-in algorithm, a block elimination method, a method based on a factorized power series expansion of the matrix inverse, and a method based on a divide and conquer matrix inversion technique. |
|
http://webdoc.sub.gwdg.de/ebook/e/2000/mathmanchester/u-manchester-mccm.html
(292 words)
|
|
| |
| | mse.doc |
| | A numerical method is an iterative algorithm for solving a mathematical problem by determining range values at discrete domain intervals throughout the problem domain. | | | An iterative method akin to the shooting method is used to determine lead angles. | | | The data required for the first test are: (a) the number of iterations of the shooting method required to determine an aiming solution at the desired accuracy, (b) the time required by the shooting method (including the time required by the ballistic simulation) to determine an aiming solution at the desired accuracy. |
|
http://www.smoothey.org/mse.doc
(5060 words)
|
|
| |
| | The Cosyne meeting |
| | Thus, when the sum of all overlapping areas of the globally non-iterative method is no larger than the entire domain area, which can be easily satisfied, a globally non-iterative method has lower computation cost than a globally iterative method. | | | Forthermore, since Kuznetsov's method uses the additive domain decomposition, after each subdomain has obtained all necessary information and set up the subdomain equation, each subdomain equation can be solved mutually independent of each other and hence in parallel. | | | the Hines method for a loop-free circuit with the same number of compartments, where the additional computation is due to the overlap of the subdomains. |
|
http://www.cosyne.org/program05/298.html
(895 words)
|
|
| |
| | 2004 Projects in Numerical Processing |
| | The role of a predicitor method (which is always an explicit linear multistep method) is to provide a good initial guess for an iterative method that solves a non-linear equation representing an application of an implicit multistep method (corrector). | | | The aim of this project is to examine numerically several higher-order methods and to compare their efficiency to that of the basic iterative methods. | | | In general, in order to increase the order of convergence of an iterative method one needs to know higher derivatives of the function f(x). |
|
http://www.cs.man.ac.uk/ugrad/projects/year04/pp.html
(1230 words)
|
|
| |
| | Iterative Solvers (F90) |
| | Jacobi Scheme A very simple iterative method known as the Jacobi Scheme is described. | | | Jacobi Scheme A very simple iterative method, known as the Jacobi Scheme, is described. | | | While numerical techniques abound to solve PDEs such as the Laplace equation, we will focus on the use of an iterative method as it will be shown to be readily parallelizable and lends itself to the opportunity to apply cartesian topology. |
|
http://scv.bu.edu/Tutorials/MPI/alliance/apply/solvers
(1955 words)
|
|
| |
| | Random gaussian distribution? - GameDev.Net Discussion Forums |
| | The difference is that the Box-Muller transformation transforms a uniform distribution into a Gaussian distribution directly and exactly, using a few log and trig operations, while the iterative method relies on the central limit theorem to produce an approximate Gaussian distribution by adding several random numbers together. | | | I am no saying Box-Muller Transform does not work I am saying the people using Box-Muller may have a better Gausian function that the people using the iterative aproach, but the iterative method is very, very good. | | | Posted - 7/18/2005 1:31:32 PM I am no saying Box-Muller Transform does not work I am saying the people using Box-Muller may have a better Gausian function that the people using the iterative aproach, but the iterative method is very, very good. |
|
http://www.gamedev.net/community/forums/topic.asp?topic_id=331647
(3074 words)
|
|
| |
| | Stationary Iterative Methods |
| | An iterative method of the the type above is called a stationary iterative method. | | | If the method converges, then as u gets very close to U, both u and u' are as close to U as you like. | | | We regard an iteration method as useful only if it works for all possible right hand sides - or equivalently, for all possible solutions U. If it only worked for some right hand sides we would never be sure whether it might happen to work for our case. |
|
http://www.cs.colorado.edu/~mcbryan/3656.04/mail/82.htm
(1313 words)
|
|
| |
| | 109452.041216&ELEMENT_SET=DECL |
| | The method as in claim 22, further comprising: applying an interpolation mapping of nodes in one grid to a next finer grid; performing the iterative smoothing operation at the next finer level; and repeating the interpolation mapping and the iterative smoothing operation until reaching the finest grid. | | | The method as in claim 14, wherein the coarsest level is a level where a matrix equation for nodes in the level is solvable by a direct matrix method such as the Gaussian elimination method. | | | An algebraic multigrid method is applied to a matrix representative of a circuit network to construct a plurality of matrices with different degrees of coarsening grids. |
|
http://www.wipo.int/cgi-pct/guest/getbykey5?KEY=04/109452.041216&ELEMENT_SET=DECL
(5965 words)
|
|
| |
| | mm-2245.txt |
| | But in the case where the matrix is sparse and N is very large (N>1e4) you may want to use an iterative method for solving the equation system instead. | | | But in the case where the matrix is sparse and N is very large > (N>1e4) you may want to use an iterative method for solving the > equation system instead. | | | If you construct it with > their routines you get dozens of iterative methods and preconditioners > According to your web page it is done in C. I need something in > fortran (90). |
|
http://www.grahamkendall.net/Math/MathNewsgroups/mm-2245.txt
(5965 words)
|
|
| |
| | Rice University Progress Report 95/96 |
| | The TRQ iteration is competitive with the Rational Krylov Method of Ruhe when the shift-invert equations can be solved directly and with the Jacobi-Davidson Method of Sleijpen and Van der Vorst when these equations are solved inexactly with a preconditioned iterative method. | | | The TRQ iteration is related to both of these but is derived directly from the RQ iteration and thus inherits the convergence properties of that method. | | | We have developed a new a new Krylov subspace iteration for large scale eigenvalue problems that is able to accelerate the convergence through an inexact (iterative) solution to a shift-invert equation. |
|
http://www.netlib.org/scalapack/rice-prog-rep.html
(5965 words)
|
|
| |
| | 1999 Summary of Engineering Research - Electrical and Computer |
| | In the inverse problem, we will apply the Born iterative and distorted Born iterative method to solve inverse problems related to well-logging using efficient forward solvers. | | | In this project, we study the use of the distorted Born iterative method and the local shape function method to study the inversion of well-logging tools. | | | The goal of this project is to develop a finite-element method using vector elements for electromagnetic analysis of electronic devices, circuits, antennas, and radar scattering. |
|
http://www.engr.uiuc.edu/communications/engineering_research/1999/pg000104.htm
(1289 words)
|
|
| |
| | Computational Chemistry Terms |
| | The key component to the CHELP method is that it is non-iterative, rather using a Lagrangian multiplier method. | | | The method is based on creating atomic natural orbitals from the molecular orbitals, by finding eigenfunctions of atomic sub-blocks of the molecular density matrix. | | | INDO - (Intermediate Neglect of Differential Overlap) A semiempirical method closely related to the CNDO method, where all terms of the Fock matrix used in CNDO are included and the restriction that the monocentric two-electron integrals all be equal is lifted. |
|
http://www.quimica.urv.es/~bo/MOLMOD/Acronyms.html
(1289 words)
|
|
| |
| | S5 Numerical Analysis and Optimisation Techniques |
| | Numerical solution of polynomial and transcendental equations: Bisection method Regula-falsi method Newton Raphson method fixed point method of iteration Rates of convergence of these methods - Solution of system of algebraic equations: exact methods Crout's triangularization method Iterative methods: Gauss Seidel and Relaxation method. | | | Module III: (16 hours) Optimization Techniques I: Optimization methods: Mathematical formulation of linear programming problem - simplex method artificial variables Charnes M method Two phase technique duality in linear programming dual simplex method. | | | Salvadori and Baron, Numerical Methods in Engineering, Prentice-Hall India. |
|
http://www.web.nitc.ac.in/~cse/Syllabus/S5/s5%20502%20na.htm
(1289 words)
|
|
|
