MétaCan
Menu
Back to cohort
Record W2598855292 · doi:10.1139/tcsme-2016-0002

ADAPTIVE SPARSE GALERKIN METHODS FOR VIBRATING CONTINUOUS STRUCTURES

2016· article· en· W2598855292 on OpenAlexvenueno aff
Zaid Ahsan, Thomas K. Uchida, C. P. Vyasarayani

Bibliographic record

VenueTransactions of the Canadian Society for Mechanical Engineering · 2016
Typearticle
Languageen
FieldPhysics and Astronomy
TopicModel Reduction and Neural Networks
Canadian institutionsnot available
Fundersnot available
KeywordsGalerkin methodMathematicsOrdinary differential equationPartial differential equationApplied mathematicsOdeNonlinear systemLasso (programming language)Projection (relational algebra)Backward Euler methodEuler's formulaOperator (biology)Mathematical analysisAlgorithmDifferential equationEuler equationsComputer sciencePhysics

Abstract

fetched live from OpenAlex

Adaptive reduced-order methods are explored for simulating continuous vibrating structures. The Galerkin method is used to convert the governing partial differential equation (PDE) into a finite-dimensional system of ordinary differential equations (ODEs) whose solution approximates that of the original PDE. Sparse projections of the approximate ODE solution are then found at each integration time step by applying either the least absolute shrinkage and selection operator (lasso) or the optimal subset selection method. We apply the two projection schemes to the simulation of a vibrating Euler-Bernoulli beam subjected to nonlinear unilateral and bilateral spring forces. The subset selection approach is found to be superior for this application, as it generates a solution with similar sparsity but substantially lower error than the lasso.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.831
Threshold uncertainty score0.303

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.021
GPT teacher head0.262
Teacher spread0.240 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueTransactions of the Canadian Society for Mechanical EngineeringSame topicModel Reduction and Neural NetworksFrench-language works237,207