Algorithm 687: a decision tree for the numerical solution of initial value ordinary differential equations

Addison, Cliff; Enright, W. H.; Gaffney, P. W.; Gladwell, I.; Hanson, P. M.

doi:10.1145/103147.103148

Cited by 11 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In many cases, it does not take into account all available problem features and cannot incorporate the latest solution methods. The recommendations have to be 'over-cautious' to prevent various numerical disasters [20]. Furthermore, recommendations provided in this way cannot be used independently of the accompanying software/modules (and hence do not constitute a Grid service by themselves).…”

Section: Mypythia Methodologymentioning

confidence: 99%

MyPYTHIA: a recommendation portal for scientific software and services

Houstis

Catlin

Dhanjani

et al. 2002

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYWe outline the design of a recommendation system (MyPYTHIA) implemented as a Web portal. MyPYTHIA's design objectives include evaluating the quality and performance of scientific software on Grid platforms, creating knowledge about which software and computational services should be selected for solving particular problems, selecting parameters of software (or of computational services) based on user-specified computational objectives, providing access to performance data and knowledge bases over the Web and enabling recommendations for targeted application domains. MyPYTHIA uses a combination of statistical analysis, pattern extraction techniques and a database of software performance to map featurebased representations of problem instances to appropriate software. MyPYTHIA's open architecture allows the user to customize it for conducting individual case studies. We describe the architecture as well as several scientific domains of knowledge enabled by such case studies.

show abstract

Section: Mypythia Methodologymentioning

confidence: 99%

MyPYTHIA: a recommendation portal for scientific software and services

Houstis

Catlin

Dhanjani

et al. 2002

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…As noted in [Lucks and Gladwell 1992], traditional decision tree algorithms (such as ID3 [Quinlan 1986;Addison et al 1991] etc. ), use a greedy approach to select relevant features.…”

Section: Examplesmentioning

confidence: 99%

Note on generalization in experimental algorithmics

Ramakrishnan

Valdés-Pérez

2000

ACM Trans. Math. Softw.

View full text Add to dashboard Cite

A recurring theme in mathematical software evaluation is the generalization of rankings of algorithms on test problems to build knowledge-based recommender systems for algorithm selection. A key issue is to profile algorithms in terms of the qualitative characteristics of benchmark problems. In this methodological note, we adapt a novel all-pairs algorithm for the profiling task -Given performance rankings for m algorithms on n problem instances, each described with p features, identify a (minimal) subset of p that is useful for assessing the selective superiority of an algorithm over another, for all pairs of m algorithms. We show how techniques presented in the mathematical software literature are inadequate for such profiling purposes. In conclusion, we also address various statistical issues underlying the effective application of this technique.

show abstract

“…(9) with these known Lagrange multipliers and contact positions. In this work, the one step method is employed for the time integration, and hence the complicated discontinuous motion due to the impacts between the track and the road wheels, and between the track and the ground may be efficiently computed (e. g., Addison, Enright, Gaffney, Gladwell, and Hanson (1991), and Cash and Karp (1990». For the dynamic analysis of the multibodies, besides holonomic constraint Eq. (1), the following differential constraints should also be satisfied on the kinematic joints:…”

Section: Solution Strategymentioning

confidence: 99%

A numerical method for dynamic analysis of tracked vehicles of high mobility

Lee

2000

KSME International Journal

View full text Add to dashboard Cite

A numerical method is presented for the dynamic analysis of military tracked vehicles of high mobility. To compute the impulsive dynamic contact forces which occur when a vehicle passes on a ground obstacle, the track is modeled as the combination of elastic links interconected by pin joints. The mass of each track link, the elastic elongation of a track link between pin joints by the track tension, and the elastic spring effects on the upper and lower surfaces of each track link have been considered in the equations of motion. And the chassis, torsion bar arms, and road wheels of the vehicle are modeled as the rigid multibodies connected with kinematic constraints. The contact positions and the contact forces between the road wheels and track, and the ground and the the track are simultaneously computed with the solution of the equations of motions of the vehicle consisting of the multi bodies. The iterative scheme for the solution of the multibody dynamics of the tracked vehicle is presented and the numerical simulations are conducted.

show abstract

Algorithm 687: a decision tree for the numerical solution of initial value ordinary differential equations

Cited by 11 publications

References 6 publications

MyPYTHIA: a recommendation portal for scientific software and services

MyPYTHIA: a recommendation portal for scientific software and services

Note on generalization in experimental algorithmics

A numerical method for dynamic analysis of tracked vehicles of high mobility

Contact Info

Product

Resources

About