4 resultados para grid points
em BORIS: Bern Open Repository and Information System - Berna - Suiça
Resumo:
Three comprehensive one-dimensional simulators were used on the same PC to simulate the dynamics of different electrophoretic configurations, including two migrating hybrid boundaries, an isotachophoretic boundary and the zone electrophoretic separation of ten monovalent anions. Two simulators, SIMUL5 and GENTRANS, use a uniform grid, while SPRESSO uses a dynamic adaptive grid. The simulators differ in the way components are handled. SIMUL5 and SPRESSO feature one equation for all components, whereas GENTRANS is based on the use of separate modules for the different types of monovalent components, a module for multivalent components and a module for proteins. The code for multivalent components is executed more slowly compared to those for monovalent components. Furthermore, with SIMUL5, the computational time interval becomes smaller when it is operated with a reduced calculation space that features moving borders, whereas GENTRANS offers the possibility of using data smoothing (removal of negative concentrations), which can avoid numerical oscillations and speed up a simulation. SPRESSO with its adaptive grid could be employed to simulate the same configurations with smaller numbers of grid points and thus is faster in certain but not all cases. The data reveal that simulations featuring a large number of monovalent components distributed such that a high mesh is required throughout a large proportion of the column are fastest executed with GENTRANS.
Resumo:
In astrophysical regimes where the collisional excitation of hydrogen atoms is relevant, the cross-sections for the interactions of hydrogen atoms with electrons and protons are necessary for calculating line profiles and intensities. In particular, at relative velocities exceeding ∼1000 km s−1, collisional excitation by protons dominates over that by electrons. Surprisingly, the H–H+ cross-sections at these velocities do not exist for atomic levels of n≥ 4, forcing researchers to utilize extrapolation via inaccurate scaling laws. In this study, we present a faster and improved algorithm for computing cross-sections for the H–H+ collisional system, including excitation and charge transfer to the n≥ 2 levels of the hydrogen atom. We develop a code named BDSCX which directly solves the Schrödinger equation with variable (but non-adaptive) resolution and utilizes a hybrid spatial-Fourier grid. Our novel hybrid grid reduces the number of grid points needed from ∼4000n6 (for a ‘brute force’, Cartesian grid) to ∼2000n4 and speeds up the computation by a factor of ∼50 for calculations going up to n= 4. We present (l, m)-resolved results for charge transfer and excitation final states for n= 2–4 and for projectile energies of 5–80 keV, as well as fitting functions for the cross-sections. The ability to accurately compute H–H+ cross-sections to n= 4 allows us to calculate the Balmer decrement, the ratio of Hα to Hβ line intensities. We find that the Balmer decrement starts to increase beyond its largely constant value of 2–3 below 10 keV, reaching values of 4–5 at 5 keV, thus complicating its use as a diagnostic of dust extinction when fast (∼1000 km s−1) shocks are impinging upon the ambient interstellar medium.
Resumo:
Temperature changes in Antarctica over the last millennium are investigated using proxy records, a set of simulations driven by natural and anthropogenic forcings and one simulation with data assimilation. Over Antarctica, a long term cooling trend in annual mean is simulated during the period 1000–1850. The main contributor to this cooling trend is the volcanic forcing, astronomical forcing playing a dominant role at seasonal timescale. Since 1850, all the models produce an Antarctic warming in response to the increase in greenhouse gas concentrations. We present a composite of Antarctic temperature, calculated by averaging seven temperature records derived from isotope measurements in ice cores. This simple approach is supported by the coherency displayed between model results at these data grid points and Antarctic mean temperature. The composite shows a weak multi-centennial cooling trend during the pre-industrial period and a warming after 1850 that is broadly consistent with model results. In both data and simulations, large regional variations are superimposed on this common signal, at decadal to centennial timescales. The model results appear spatially more consistent than ice core records. We conclude that more records are needed to resolve the complex spatial distribution of Antarctic temperature variations during the last millennium.
Resumo:
This package includes various Mata functions. kern(): various kernel functions; kint(): kernel integral functions; kdel0(): canonical bandwidth of kernel; quantile(): quantile function; median(): median; iqrange(): inter-quartile range; ecdf(): cumulative distribution function; relrank(): grade transformation; ranks(): ranks/cumulative frequencies; freq(): compute frequency counts; histogram(): produce histogram data; mgof(): multinomial goodness-of-fit tests; collapse(): summary statistics by subgroups; _collapse(): summary statistics by subgroups; gini(): Gini coefficient; sample(): draw random sample; srswr(): SRS with replacement; srswor(): SRS without replacement; upswr(): UPS with replacement; upswor(): UPS without replacement; bs(): bootstrap estimation; bs2(): bootstrap estimation; bs_report(): report bootstrap results; jk(): jackknife estimation; jk_report(): report jackknife results; subset(): obtain subsets, one at a time; composition(): obtain compositions, one by one; ncompositions(): determine number of compositions; partition(): obtain partitions, one at a time; npartitionss(): determine number of partitions; rsubset(): draw random subset; rcomposition(): draw random composition; colvar(): variance, by column; meancolvar(): mean and variance, by column; variance0(): population variance; meanvariance0(): mean and population variance; mse(): mean squared error; colmse(): mean squared error, by column; sse(): sum of squared errors; colsse(): sum of squared errors, by column; benford(): Benford distribution; cauchy(): cumulative Cauchy-Lorentz dist.; cauchyden(): Cauchy-Lorentz density; cauchytail(): reverse cumulative Cauchy-Lorentz; invcauchy(): inverse cumulative Cauchy-Lorentz; rbinomial(): generate binomial random numbers; cebinomial(): cond. expect. of binomial r.v.; root(): Brent's univariate zero finder; nrroot(): Newton-Raphson zero finder; finvert(): univariate function inverter; integrate_sr(): univariate function integration (Simpson's rule); integrate_38(): univariate function integration (Simpson's 3/8 rule); ipolate(): linear interpolation; polint(): polynomial inter-/extrapolation; plot(): Draw twoway plot; _plot(): Draw twoway plot; panels(): identify nested panel structure; _panels(): identify panel sizes; npanels(): identify number of panels; nunique(): count number of distinct values; nuniqrows(): count number of unique rows; isconstant(): whether matrix is constant; nobs(): number of observations; colrunsum(): running sum of each column; linbin(): linear binning; fastlinbin(): fast linear binning; exactbin(): exact binning; makegrid(): equally spaced grid points; cut(): categorize data vector; posof(): find element in vector; which(): positions of nonzero elements; locate(): search an ordered vector; hunt(): consecutive search; cond(): matrix conditional operator; expand(): duplicate single rows/columns; _expand(): duplicate rows/columns in place; repeat(): duplicate contents as a whole; _repeat(): duplicate contents in place; unorder2(): stable version of unorder(); jumble2(): stable version of jumble(); _jumble2(): stable version of _jumble(); pieces(): break string into pieces; npieces(): count number of pieces; _npieces(): count number of pieces; invtokens(): reverse of tokens(); realofstr(): convert string into real; strexpand(): expand string argument; matlist(): display a (real) matrix; insheet(): read spreadsheet file; infile(): read free-format file; outsheet(): write spreadsheet file; callf(): pass optional args to function; callf_setup(): setup for mm_callf().