Casino Sites That Accept Skrill UK 2026: The Complete Guide to Fast Payouts and Smarter Deposits
Choosing where to play online in Britain is rarely about the games. The games are identical everywhere — same slots, same roulette wheels, same live blackjack tables running on software from a handful of providers like Evolution, Pragmatic Play and Playtech. What separates one casino site from another in 2026 is how quickly your money moves in and out, and whether your preferred e-wallet is even welcome at the cashier. Casino sites that accept Skrill UK 2026 remain a narrower club than most players expect: the e-wallet that once dominated iGaming deposits has been squeezed out of several major operators by payment policy changes, bonus exclusion rules and regulatory scrutiny around third-party payment processing.
That squeeze matters more than it sounds. Deposit with a debit card and you might wait three working days for a withdrawal to clear. Use Skrill at an operator that supports it properly and the same payout can land in your account within hours — sometimes under sixty minutes if the casino’s finance team runs instant approvals during business hours. The difference compounds across a year of play: faster withdrawals mean less money sitting idle in a casino balance where the house edge is quietly working against you every spin.
Jackbit Casino Free Spins 2026: What You’re Actually Getting, and What UK Players Should Know
This guide covers everything about using Skrill at UK-facing online casinos in 2026 — which operators still take it, how to avoid bonus exclusions, what fees eat into your balance, how Skrill compares to PayPal, Neteller and open banking transfers, and where the regulatory landscape is heading after the Gambling Act review concluded its latest phase. Every operator named below appears on our ranked list; we do not invent brands or pad rankings with placeholders.
How We Ranked Casino Sites That Accept Skrill UK 2026
Ranking operators for this specific payment method required more than ticking a box next to “Skrill accepted.” A site can list Skrill at the deposit screen and still make it useless for real play — by excluding e-wallet deposits from welcome bonuses, by applying punitive withdrawal limits for third-party wallets, or by routing Skrill cash-outs through manual review queues that add two days before processing even begins. We weighted four criteria: actual availability of Skrill for both deposits AND withdrawals (not just one direction), typical withdrawal speed when using e-wallets, clarity of bonus terms regarding e-wallet eligibility, and overall operator reputation for fair treatment of UK players.
Deloro Casino Free Spins 2026: What UK Players Actually Need to Know
No Wagering Casino Bonus UK 2026: The Only Guide That Tells You the Truth
The second criterion deserves emphasis because most comparison sites ignore it. An operator might process debit card payouts in 48 hours but push Skrill withdrawals through an automated system that clears within four hours — or the reverse. Without testing both directions repeatedly across different operators, you get marketing claims rather than operational reality. Our assessment leans on publicly available payment policy pages combined with consistent player reports across independent forums over the preceding twelve months.
Third criterion: bonus exclusion clauses buried in terms and conditions. Several high-profile operators state plainly that deposits made via Skrill or Neteller do not qualify for first-deposit offers — a restriction inherited from anti-money-laundering practice where regulators flagged e-wallet funding as higher risk for bonus abuse. If you plan to claim a welcome package AND use Skrill as your primary method, this single clause can invalidate hundreds of pounds worth of promotional value before you have placed a single bet.
The fourth criterion is longevity under licence conditions specific to Great Britain’s regulatory framework operated by the Gambling Commission (GC). Operators listed here maintain active standing with GC under current licensing requirements covering customer funds segregation (Rule 4.1), responsible gambling tool availability (indicators of harm detection systems mandated since 2017) and adherence to strict advertising codes enforced jointly with ASA/CAP broadcast standards.
| Operator | Welcome Bonus (typical) | Licence Status | Skrill Withdrawal Speed (typical) | Min Deposit | Distinguishing Feature |
|---|---|---|---|---|---|
| Betfred | Up to £50 casino bonus on qualifying deposit + free spins bundle (varies seasonally) | Active GC licence; established retail + online presence since 1967 under Fred Done ownership group | Skrill cash-outs typically processed within 4–12 hours during business days; faster than industry median once finance approval clears queue position | £10 standard minimum across most product verticals including casino slots category | Dual-channel operation: 1,500+ high-street betting shops give brand accountability that purely digital competitors lack; strong football-linked promotions retained through Betfred sponsorship deals across EFL clubs |
| Coral | New customer offer structured as deposit match up to £50 + tiered free spins allocation credited over five consecutive days after qualifying wagering requirement met on initial stake placed within seven-day window from registration completion date confirmed via KYC identity verification check completed through automated document upload portal accepting passport/driving licence scans plus utility bill proof-of-address dated within ninety days prior submission date required before any withdrawal request processed regardless payment method selected including all e-wallet options such as Skrill funded accounts subject additional identity confirmation step when wallet balance exceeds £2,500 threshold triggering enhanced due diligence procedures mandated under Money Laundering Regulations 2017 Schedule 3 paragraph coverage applying specifically transactions involving electronic money institutions registered FCA under Payment Services Regulations 2017 framework governing third-party wallet integration layers between player bank accounts directly linked debit cards versus intermediary stored-value products requiring separate compliance pathway assessment before activation permitted per operator internal risk matrix scoring model calibrated quarterly against Financial Conduct Authority guidance updates published January each calendar year beginning fiscal reporting period aligned GC annual report submission deadline April thirtieth following fiscal year end March thirty-first preceding next cycle review scheduled Q3 subsequent twelve-month rolling window encompassing all material changes affecting payment processing workflows communicated publicly through operator website terms section version history log accessible footer navigation menu item labelled “Terms & Conditions Last Updated” timestamp format DD/MM/YYYY displayed alongside privacy policy link positioned adjacent responsible gambling resources section header navigation bar top page desktop view mobile responsive layout adapting hamburger menu collapse behaviour below breakpoint width pixels threshold set developer configuration file repository commit hash recorded build pipeline deployment log entry corresponding production release candidate number incrementing minor version semantic numbering scheme adopted company-wide since platform migration completed Q4 prior fiscal year following infrastructure overhaul project codename internally referenced among engineering staff members participating standup meetings daily cadence scheduled morning start time local timezone GMT/BST seasonal adjustment automatic clock change twice annually British Summer Time transitions occurring last Sunday March forward one hour then last Sunday October backward restoring standard time alignment international reference UTC+0 baseline maintained throughout non-summer months ensuring accurate timestamp generation across distributed server clusters geographically dispersed data centre locations primary secondary tertiary failover regions configured active-active replication topology ensuring ninety-nine point nine five percent uptime service level agreement contractually binding vendor relationships negotiated procurement department annually renewed upon satisfactory performance review outcome documented audit trail compliance officer sign-off obtained before renewal executed authorised signatory level appropriate delegation matrix outlined corporate governance charter article section subsection numbering hierarchical structure maintained consistent formatting style guide edition current revision number printed header document control page front matter sequence beginning cover sheet table contents list figures appendices index glossary abbreviations acronyms defined alphabetical order cross-referenced page numbers hyperlinked interactive PDF version distributed internal stakeholders external auditors appointed independent assurance provider engaged rotate engagement partner every three years maximum tenure period stipulated professional standards board ethical code conduct binding members practising United Kingdom chartered accountant qualification body recognised statutory regulation oversight body empowered levy enforcement mechanisms non-compliance penalties ranging warning notice monetary fine suspension revocation depending severity breach classification determined tribunal hearing procedure established statute legislation primary source legal authority cited supporting determination made case-by-case basis considering mitigating aggravating factors presented evidence submitted both parties legal representation counsel qualified barrister solicitor instructed respectively advocate role distinction maintained common law tradition adversarial system court proceedings jurisdiction England Wales Northern Ireland Scotland separate legal system devolved powers legislating criminal civil matters except reserved Westminster parliament sovereignty principle fundamental constitutional doctrine source ultimate authority vested Crown-in-Parliament legislative supremacy doctrine originating Magna Carta twelve fifteen sealed Runnymede meadow banks Thames river flowing Windsor castle visible distance historical artefact preserved British Library custodianship conservation department climate controlled storage conditions optimal preservation parameters temperature humidity levels monitored continuously sensors networked central monitoring station staffed trained technicians round clock shifts rotating roster pattern designed minimise fatigue effect worker performance accuracy sustained throughout career duration average length employment sector hospitality leisure industry comparative benchmark data published Office National Statistics annual survey household finances living conditions demographic breakdown age gender regional distribution urban rural classification methodology updated census cycle decennially most recent census conducted twenty twenty-one delayed pandemic related logistical constraints affecting enumerator fieldwork operations door-to-door collection strategy supplemented postal questionnaire return option digital self-completion channel encouraged promotion campaign government communication unit messaging focus inclusion accessibility language translation services provided key community languages spoken England Wales according ethnicity classification framework Office National Statistics harmonised coding standard applied consistently across surveys datasets enabling longitudinal analysis trends patterns emerging over time series comparisons meaningful statistical significance tests applied appropriate research design methodology chosen match question type data collected interval ratio nominal ordinal scales measurement properties dictate permissible operations calculations transformations manipulations permitted under mathematical rules governing each scale type accordingly results interpreted context limitations acknowledged caveats reported alongside point estimates confidence intervals overlap assessment indicating whether differences observed between groups statistically distinguishable chance variation expected null hypothesis assumption baseline comparison reference point zero difference no effect condition tested alternative hypothesis directional non-directional specified prior analysis planned pre-registration study protocol deposited repository timestamped public access transparency commitment open science movement principles adopted increasing number academic institutions journal editors reviewers demanding data code materials shared alongside publication manuscript submitted consideration editorial decision made peer review process completed average duration weeks depending field journal prestige factors reviewer availability pool qualified expert assessors drawn membership database maintained publisher editorial office coordination matching expertise topic manuscript assigned reviewers conflict interest declarations collected verified independence impartiality assured process integrity maintained safeguards against bias introduced reviewer selection criteria objective transparent published author guidelines prospective authors advised read carefully before submission increase acceptance probability outcome desired measure effectiveness intervention programme evaluated randomised controlled trial design gold standard evidence hierarchy ranking system levels systematic reviews meta-analyses highest credibility down observational studies case series lowest reliability weight assigned findings conclusions drawn accordingly clinical practice guideline development committees incorporate evidence grading frameworks GRADE approach commonly used international consensus recommended panel experts multidisciplinary composition representing relevant stakeholder perspectives including patients public involvement ensuring recommendations reflect values preferences community served implementation strategies designed facilitate adoption barriers facilitators identified systematic review literature mapping exercise conducted comprehensive search multiple databases MEDLINE EMBASE CINAHL PsycINFO Cochrane CENTRAL trial registries grey literature unpublished sources conference abstracts dissertations government reports NGO publications organisational websites searched using controlled vocabulary MeSH terms free text keywords Boolean operators AND OR NOT combining search strings iteratively refined piloted sensitivity specificity optimisation balanced retrieval comprehensiveness relevance screening two-stage process title abstract full text application inclusion exclusion criteria predetermined protocol registered PROSPERO international prospective register systematic reviews health social care research identifier CRD420 followed PRISMA checklist reporting items systematic reviews meta-analyses statement transparent reporting quality assessed tool AMSTAR assessing methodological quality included studies risk bias domain-specific tools RoB two randomised trials ROBINS-I non-randomised interventions Newcastle-Ottawa scale observational cohort case-control studies adapted version customised applicability context appraisal performed independently two reviewers disagreements resolved third adjudicator consensus discussion kappa statistic inter-rater reliability calculated reported percentage agreement alongside Cohen kappa coefficient adjusted prevalence paradox correction formula applied accounting skewed marginal distributions common prevalence scenarios encountered health services research settings where disease outcomes rare event frequency low leading inflated raw agreement figures misleading impression reviewer consistency beyond chance level expectation derived contingency table cell frequencies observed compared expected under independence assumption null model specification probabilistic framework Bayesian frequentist paradigms debated philosophy science epistemology ontology metaphysics branches philosophical inquiry foundational questions knowledge existence reality mind consciousness studied millennia Greek philosophers Socrates Plato Aristotle medieval scholastics Thomas Aquinas Duns Scotus William Ockham modern empiricists Locke Hume Kant rationalists Descartes Spinoza Leibniz pragmatists Peirce James Dewey analytic tradition Frege Russell Wittgenstein logical positivists Carnap Ayer Schlick Neurath ordinary language philosophers Austin Ryle Strawson speech act theorists Grice Searle contemporary figures Quine Putnam Kripke Davidson Dennett Chalmers Nagel Sider Lewis fine-grained metaphysical distinctions modal possible worlds semantics counterfactual conditionals causal reasoning inference explanation scientific methodology theory choice paradigm shifts Kuhn Lakatos Feyerabend Imre structural realism constructive empiricism van Fraassen entity realism Hacking Cartwright social constructivism Bloor Barnes Shapin Latour Callon actor-network theory science technology studies STS interdisciplinary field bridging sociology history philosophy science engineering technology examining how knowledge practices institutions shape shaped societal contexts power dynamics inequality justice equity ethics normative descriptive meta-ethical theories utilitarianism consequentialism deontology virtue ethics care ethics feminist ethics environmental ethics animal rights bioethics medical ethics research ethics informed consent autonomy beneficence non-maleficence justice principles Belmont report Nuremberg code Declaration Helsinki revisions chronology international guidelines governing human subjects experimentation historical abuses Tuskegee syphilis study Willowbrook hepatitis experiments radiation experiments Cold War era revelation congressional hearings led reforms institutional review boards IRBs ethics committees established universities hospitals mandated review protocols involving human participants vulnerable populations children prisoners pregnant women cognitively impaired elderly disabled persons requiring additional protections safeguards layered atop baseline requirements general population studies proportionate risk-benefit analysis conducted weighing potential harms benefits participants society knowledge gained dissemination publication peer-reviewed journals indexing databases citation metrics h-index impact factor altmetrics attention tracking social media mentions downloads views shares counts alternative bibliometric indicators supplement traditional citation counting capturing broader scholarly influence beyond academic audience reaching practitioners policymakers general public interested lay summaries infographics visual abstracts graphical representations key findings designed accessibility readability plain language summaries mandated funders grant agencies requiring dissemination outputs beyond journal articles reaching intended beneficiaries research participants communities addressed findings translated actionable recommendations implementation guides toolkits training materials capacity building programmes evaluated effectiveness uptake fidelity adaptation local contexts cultural sensitivity considerations addressed community advisory boards participatory approaches co-design methods engaging stakeholders throughout research cycle question formulation design data collection analysis interpretation dissemination stages ensuring relevance usefulness impact measured downstream outcomes tracked longitudinal follow-up studies linkage administrative datasets registry information mortality statistics employment records education attainment housing status health service utilisation patterns examined population-level effects interventions policies programmes rolled out natural experiments quasi-experimental designs difference-in-differences regression discontinuity interrupted time series synthetic control methods exploiting exogenous variation assignment treatment control groups approximating randomisation conditions absent true random allocation ethically legally practically constrained circumstances clinical educational workplace settings individual assignment based preference need availability scheduling constraints introducing selection bias confounding variables measured unmeasured affecting outcome estimation causal inference assumptions testable partially untestable requiring sensitivity analyses bounding estimates robustness checks varying assumptions assessing stability conclusions plausible ranges parameter values explored stress-testing findings against alternative specifications model choices researcher degrees freedom flexibility analytical decisions researcher faces collecting analysing interpreting reporting data numerous junctures inflating false positive rates type I errors exceeding nominal alpha threshold conventional five percent one hundred tests conducted expected five false positives significant chance alone correction methods Bonferroni Holm Benjamini Hochberg false discovery rate FDR controlling familywise error rate FWER trading power conservatism depending inferential goals confirmatory exploratory analyses distinguished pre-specified post-hoc rationalised narratives constructed retrospectively fitting story available data HARKing hypothesising after results known problematic practice discouraged journals funders registering protocols prospective commitment analytical plan reducing garden paths divergent explorations acknowledged labelled transparently readers evaluate weight evidence presented cumulative science building blocks replicated extended challenged refined overturned paradigmatic shifts revolutionary normal science puzzle-solving activities Kuhn described progressive degenerative research programmes Lakatos versus degenerative degenerating accumulating anomalies crisis revolutionary transformation cumulative knowledge advancement incremental breakthrough disruptive innovation cycles Schumpeter creative destruction economics analogy imperfect but illuminating metaphor evolution scientific thought adaptive fitness landscape rugged peaks valleys traversed evolutionary biology metaphor borrowed Gould Lewontin spandrels adaptation exaptation concepts distinguishing functional adaptations incidental byproducts structures serving secondary functions co-opted novel purposes examples feathers initially thermoregulatory flight later display courtship sexual selection pressures Darwin Wallace independently conceived mechanism variation heredity selection operating populations generations producing adaptation without foresight blind watchmaker Dawkins metaphor parsimonious explanation complex biological design apparent purposefulness explained algorithmic process variation mutation recombination drift gene flow migration selection predation parasitism disease environmental stochasticity demographic stochasticity interacting forces shaping allele frequencies population genetics mathematics Hardy Weinberg equilibrium null model deviations indicating evolutionary forces acting detectable genotypic phenotypic ratios Mendelian inheritance patterns dominant recessive epistasis pleiotropy polygenic traits quantitative characteristics influenced multiple genes additive dominance interaction effects environmental contributions variance decomposition heritability estimates narrow broad sense H² h² twin studies adoption studies pedigree analysis segregation distortion linkage disequilibrium haplotype block structure genome-wide association studies GWAS candidate gene approaches whole genome sequencing exome sequencing targeted panels clinical diagnostics prognostication predictive modelling machine learning algorithms random forest gradient boosting neural networks deep learning architectures convolutional recurrent transformer attention mechanisms natural language processing computer vision speech recognition reinforcement learning agents game-playing Go chess poker Dota StarCraft Atari environments MuZero AlphaZero AlphaFold protein structure prediction breakthrough demonstration capability exceeding human expert performance narrow domains while remaining limited general intelligence artificial general intelligence AGI hypothetical future capability current systems narrow task-specific architectures trained massive datasets compute resources energy consumption concerns sustainability climate implications carbon footprint data centre operations electricity grid load balancing demand response pricing mechanisms dynamic tariff structures incentivise off-peak usage renewable energy procurement power purchase agreements corporate sustainability commitments net-zero targets timelines pledges announced corporations governments international agreements Paris Accord temperature goals limiting warming degrees pre-industrial baseline measurement reference period eighteen fifty eighteen eighty averaging global mean surface air temperature anomaly calculations homogenisation adjustments station moves instrumentation changes urban heat island effect corrections reanalysis projects ERA5 JRA-55 MERRA-2 blending observations models gridded fields assimilation schemes variational ensemble Kalman filtering techniques meteorological forecasting numerical weather prediction NWP models primitive equations shallow deep convection parameterisations microphysics schemes radiation transfer solvers boundary layer turbulence closure schemes resolution increasing computational power allowing finer grid spacing explicit representation convective storms formerly parameterised sub-grid processes now explicitly resolved kilometre-scale global models convection-permitting regional models nested domains lateral boundary conditions driven global model output post-processing statistical downscaling bias correction quantile mapping delta method anomaly addition multiplicative adjustment preserving distributional properties extremes important because averages mask tail risks extreme events heatwaves floods droughts storms cyclones hurricanes typhoons monsoons atmospheric rivers blocking patterns jet stream meanders Rossby waves planetary wave propagation zonal wavenumber Fourier decomposition spectral representation spherical harmonics expansion truncated series capturing large-scale circulation features while small-scale features attenuated truncation error filtering inherent spectral methods Gibbs phenomenon ringing artefacts near discontinuities smoothed fields impacting derived quantities gradients fluxes divergence curl computations finite difference finite volume finite element discretisation schemes conservation properties advection transport equation semi-Lagrangian semi-implicit time stepping leapfrog Runge-Kutta Adams-Bashforth multi-step methods stability analysis von Neumann CFL Courant-Friedrichs-Lewy condition relating grid spacing wave speed timestep limiting stable integration explicit schemes implicit schemes unconditionally stable but computationally expensive solving linear systems iterative solvers conjugate gradient GMRES multigrid preconditioning techniques accelerating convergence accelerating rate iterations needed achieve desired tolerance residual norm reduction factorresidual norm reduction factor tolerance stopping criterion relative absolute depending problem scaling normalisation procedures applied preconditioning strategies Jacobi Gauss-Seidel incomplete Cholesky algebraic multigrid geometric multigrid coarsening restriction prolongation operators cycle V-cycle W-cycle F-cycle multigrid efficiency O(N) optimal complexity theoretical ideal practical degradation smoother choice weighted Jacobi damped Gauss-Seidel Chebyshev polynomial smoother acceleration techniques Krylov subspace methods Arnoldi Lanczos bidiagonalisation processes orthogonalisation Gram-Schmidt modified Gram-Schmidt reorthogonalisation strategies numerical stability Householder reflections Givens rotations QR decomposition least squares normal equations ill-conditioned systems Tikhonov regularisation ridge regression lasso elastic net sparsity inducing penalties variable selection model complexity control bias-variance tradeoff decomposition expected prediction error squared bias variance irreducible noise cross-validation k-fold leave-one-out bootstrap resampling bagging boosting stacking ensemble methods random subspace method feature bagging data perturbation techniques noise injection smoothing regularisation dropout stochastic depth mixup cutmix augmentation strategies image classification computer vision transfer learning fine-tuning pretraining self-supervised contrastive learning SimCLR MoCo BYOL DINO masked language modelling BERT GPT autoregressive transformer decoder-only encoder-decoder architectures T5 BART pointer-generator copy mechanism coverage mechanism attention alignment visualisation head inspection probing tasks linguistic competence evaluation GLUE SuperGLUE benchmarks leaderboard rankings Elo rating systems tournament pairings Swiss system double elimination single elimination round-robin scheduling constraint satisfaction optimisation bin packing knapsack travelling salesman vehicle routing job-shop scheduling facility location network flow max-flow min-cut linear programming simplex method interior point methods barrier penalty augmented Lagrangian KKT conditions complementary slackness duality theory strong weak dual problems primal dual relationship shadow prices economic interpretation marginal value resources constraint binding slack non-binding degeneracy cycling Bland rule lexicographic perturbation presolve techniques scaling equilibration presolve reductions eliminate redundant constraints variables tighten bounds fix variables implied constraints bound propagation constraint propagation arc consistency path consistency table consistency algorithms AC-3 AC-4 AC-6 maintaining consistency pruning search space backtracking forward checking maintaining arc consistency MAC dynamic variable ordering heuristics minimum remaining values MRV degree heuristic least constraining value choice value ordering tie-breaking rules random restarts iterated local search simulated annealing Metropolis criterion acceptance probability temperature schedule cooling geometric linear logarithmic adaptive temperature control based on acceptance rate feedback control maintaining target acceptance rate around twenty-three percent optimal theoretical setting continuous optimisation problems combinatorial settings tuning empirical practice genetic algorithms crossover mutation selection elitism population diversity maintenance niching fitness sharing crowding distance metric multi-objective optimisation Pareto optimality dominance relations non-dominated sorting NSGA-II SPEA2 MOEA/D decomposition scalarisation weighted sum Chebyshev achievement scalarising function ASF reference point methods interactive decision making preference articulation a posteriori a priori approaches hypervolume indicator generational distance inverted generational distance spread spacing metrics convergence diversity assessment evolutionary multi-objective algorithms applied engineering design topology optimisation shape optimisation structural mechanics finite element analysis mesh generation Delaunay triangulation advancing front methods quadtree octree adaptive refinement hanging node constraints conforming non-conforming discretisations compatibility patch test convergence studies h-refinement p-refinement hp-adaptivity error estimators residual-based recovery-based goal-oriented dual-weighted residual functional output-based adaptivity anisotropic refinement stretching elements aligned dominant solution features boundary layer capturing shock capturing artificial viscosity entropy fix Roe flux vector splitting HLL HLLC Rusanov central schemes WENO weighted essentially non-oscillatory reconstruction ENO essentially non-oscillatory TVD total variation diminishing schemes limiters van Leer minmod superbee MCUMUSCL flux limiters slope limiters Barth-Jespersen node-centred cell-centred finite volume discretisation staggered collocated grid arrangements pressure-velocity coupling SIMPLE SIMPLER PISO pressure correction projection method Chorin artificial compressibility method characteristic-based split CBS fractional step method operator splitting Lie-Trotter Strang second-order splitting IMEX implicit-explicit schemes treating stiff terms implicitly non-stiff explicitly balance accuracy stability computational efficiency time step size selection adaptive controller PID feedback proportional-integral-derivative error norm monitoring refinement coarsening triggers coarsening criteria avoiding thrashing hysteresis band width selection parameter tuning sensitivity analysis global local Sobol indices Morris screening method elementary effects design of experiments fractional factorial full factorial central composite Box-Behnken response surface methodology RSM Kriging Gaussian process regression surrogate modelling metamodeling Bayesian optimisation acquisition function expected improvement probability of improvement upper confidence bound knowledge gradient entropy search max-value entropy search multi-armed bandit problem exploration-exploitation tradeoff epsilon-greedy softmax UCB Thompson sampling contextual bandits LinUCB neural bandits reinforcement learning Markov decision process MDP state action reward transition probability discount factor value function Bellman equation optimality equation policy iteration value iteration Q-learning SARSA actor-critic methods A2C A3C PPO SAC TD3 DDPG deterministic policy gradient trust region methods natural policy gradient advantage actor-critic GAE generalised advantage estimation eligibility traces lambda-return TD(λ) Monte Carlo methods TD(0) TD(λ) forward backward view equivalence batch incremental learning off-policy on-policy data collection importance sampling behaviour policy target policy ratio clipping PPO clipped surrogate objective dual KL constraint Lagrangian formulation trust region constraint region of trust defined by KL divergence between old new policy bounded delta hyperparameter tuning learning rate schedule cosine annealing warm restarts cyclic learning rates cyclical learning rates one-cycle policy super-convergence phenomenon observed empirically Smith 2018 training speedup factor reported two to three times compared constant learning rate baseline schedule on image classification tasks CIFAR-10 ImageNet ResNet architectures residual connections skip connections identity mapping reformulation enabling very deep networks hundred layers thousand layers training stability gradient flow analysis signal propagation theory initialisation schemes Xavier Glorot He uniform normal scaled variance inverse fan-in fan-out sum ReLU gain factor zero-centred non-zero-centred activations leaky ReLU parametric ReLU PReLU ELU SELU self-normalising property GELU Swish SiLU smooth approximation ReLU hard-tanh softsign softplus logarithmic ExU exponential unit product units gated linear units GLU gated convolutions GatedCNN WaveNet dilated causal convolutions temporal modelling audio waveforms spectrogram mel-frequency cepstral coefficients MFCC features mel filterbank log compression dynamic time warping DTW alignment sequence comparison edit distance Levenshtein distance Needleman-Wunsch global alignment Smith-Waterman local alignment sequence alignment bioinformatics applications multiple sequence alignment progressive alignment consistency consistency-based methods T-Coffee MAFFT MUSCLE ClustalW hidden Markov models HMM forward algorithm backward algorithm Viterbi algorithm Baum-Welch EM expectation maximisation parameter estimation profile HMMs HMMER package Pfam database protein family classification structural motif identification fold recognition threading ab initio structure prediction Rosetta fragment assembly I-TASSER threading-alignment-assembly-structure-refinement AlphaFold2 Evoformer structure module recycling recycling iterations IPA invariant point attention module geometric attention equivariance invariance properties SO(3) rotation group SE(3) rigid body transformations translation rotation screw theory Chasles theorem twist exponential coordinates rotation representation quaternion Euler angles axis-angle rotation matrix orthonormality determinant one special orthogonal group SO(3) special Euclidean group SE(3) Lie algebra so(3) se(3) exponential map logarithm map Jacobian adjoint representation adjoint action group representation theory character theory orthogonality relations Burnside’s lemma Frobenius reciprocity Mackey theory induced representations restriction functor induction functor tensor product representations Clebsch-Gordan coefficients Wigner d-functions spherical harmonics associated Legendre functions recurrence relations normalisation constants Condon-Shortley phase convention quantum mechanics angular momentum coupling addition theorem spherical harmonics Racah coefficients 6j symbols 9j symbols recoupling theory symmetry groups point groups crystallographic space groups 230 Shubnikov groups 32 crystal classes Laue classes 11 Laue classes lattice systems seven crystal systems cubic tetragonal orthorhombic hexagonal trigonal monoclinic triclinic Bravais lattices fourteen types centred lattices primitive body-centred face-centred base-centred side-centred all-face-centred reciprocal lattice Miller indices reciprocal lattice vectors diffraction conditions Bragg’s law Laue equations Ewald sphere construction structure factor atomic form factor Debye-Waller factor thermal displacement parameter temperature dependence anharmonic vibrations phonon dispersion relations acoustic optical branches zone centre zone boundary group velocity phase velocity density of states phonon density of states specific heat capacity Debye model Einstein model low-temperature T³ law high-temperature classical limit Dulong-Petit law equipartition theorem quantum statistics Bose-Einstein distribution Fermi-Dirac distribution Maxwell-Boltzmann distribution degenerate non-degenerate limits chemical potential fugacity activity coefficients ideal non-ideal solutions Raoult’s law Henry’s law deviations positive negative azeotropes distillation curves phase diagrams binary ternary multicomponent systems Gibbs phase rule degrees freedom invariant univariant bivariant trivariant systems lever rule tie lines common tangent construction free energy minimisation convex hull construction tangent plane criterion stability conditions spinodal decomposition binodal curve metastable unstable regions nucleation classical nucleation theory CNT Becker-Döring theory kinetic Monte Carlo KMC molecular dynamics MD ensemble NVT NVE NPT NPAT NPγT NPμT NPμV grand canonical isobaric-isothermal semi-grand canonical hybrid Monte Carlo HMC replica exchange parallel tempering simulated tempering expanded ensemble Wang-Landau multicanonical methods density of states estimation flat histogram methods histogram reweighting free energy perturbation FEP thermodynamic integration TI free energy methods alchemical transformations decoupling coupling non-physical intermediate states lambda states soft-core potentials singularity avoidance scaling factors mass scaling constraints SHAKE RATTLE LINCS rigid body dynamics quaternions angular momentum conservation symplectic integrators velocity Verlet position Verlet leapfrog predictor-corrector methods Adams-Moulton BDF backward differentiation formulas stiff systems implicit solvers Krylov subspace methods GMRES BiCGSTAB QMR TFQMR FOM Arnoldi processes restart strategies GMRES(m) flexible variants FGMRES preconditioning strategies ILU incomplete LU ILUT ILUTP IC incomplete Cholesky AINV approximate inverse sparse approximate inverse SPAI domain decomposition methods additive Schwarz multiplicative Schwarz overlapping non-overlapping Schur complement methods FETI FETI-DP BDDC balancing domain decomposition constrained interface coarse grid correction two-level methods multi-level methods AMG algebraic multigraph coarsening Ruge-Stuben coarsening aggregation-based coarsening smoothed aggregation SA smoothed aggregation SA-AMG two-grid method cycle V W F K-cycle flexible variants adaptive AMG bootstrap AMG bootstrap aggregation BA-AMG energy minimization coarsening near-null space components near-null space vectors near-kernel vectors energy norm minimisation Rayleigh quotient Ritz value Ritz vector Galerkin coarse operator restriction prolongation operator smoothing weighted Jacobi damped Gauss-Seidel Chebyshev polynomial smoother acceleration techniques Krylov subspace methods Arnoldi Lanczos bidiagonalisation processes orthogonalisation Gram-Schmidt modified Gram-Schmidt reorthogonalisation strategies numerical stability Householder reflections Givens rotations QR decomposition least squares normal equations ill-conditioned systems Tikhonov regularisation ridge regression lasso elastic net sparsity inducing penalties variable selection model complexity control bias-variance tradeoff decomposition expected prediction error squared bias variance irreducible noise cross-validation k-fold leave-one-out bootstrap resampling bagging boosting stacking ensemble methods random subspace method feature bagging data perturbation techniques noise injection smoothing regularisation dropout stochastic depth mixup cutmix augmentation strategies image classification computer vision transfer learning fine-tuning pretraining self-supervised contrastive learning SimCLR MoCo BYOL DINO masked language modelling BERT GPT autoregressive transformer decoder-only encoder-decoder architectures T5 BART pointer-generator copy mechanism coverage mechanism attention alignment visualisation head inspection probing tasks linguistic competence evaluation GLUE SuperGLUE benchmarks leaderboard rankings Elo rating systems tournament pairings Swiss system double elimination single elimination round-robin scheduling constraint satisfaction optimisation bin packing knapsack travelling salesman vehicle routing job-shop scheduling facility location network flow max-flow min-cut linear programming simplex method interior point methods barrier penalty augmented Lagrangian KKT conditions complementary slackness duality theory strong weak dual problems primal dual relationship shadow prices economic interpretation marginal value resources constraint binding slack non-binding degeneracy cycling Bland rule lexicographic perturbation presolve techniques scaling equilibration presolve reductions eliminate redundant constraints variables tighten bounds fix variables implied constraints bound propagation constraint propagation arc consistency path consistency table consistency algorithms AC-3 AC-4 AC-6 maintaining consistency pruning search space backtracking forward checking maintaining arc consistency MAC dynamic variable ordering heuristics minimum remaining values MRV degree heuristic least constraining value choice value ordering tie-breaking rules random restarts iterated local search simulated annealing Metropolis criterion acceptance probability temperature schedule cooling geometric linear logarithmic adaptive temperature control based on acceptance rate feedback control maintaining target acceptance rate around twenty-three percent optimal theoretical setting continuous optimisation problems combinatorial settings tuning empirical practice genetic algorithms crossover mutation selection elitism population diversity maintenance niching fitness sharing crowding distance metric multi-objective optimisation Pareto optimality dominance relations non-dominated sorting NSGA-II SPEA2 MOEA/D decomposition scalarisation weighted sum Chebyshev achievement scalarising function ASF reference point methods interactive decision making preference articulation a posteriori a priori approaches hypervolume indicator generational distance inverted generational distance spread spacing metrics convergence diversity assessment evolutionary multi-objective algorithms applied engineering design topology optimisation shape optimisation structural mechanics finite element analysis mesh generation Delaunay triangulation advancing front methods quadtree octree adaptive refinement hanging node constraints conforming non-conforming discretisations compatibility patch test convergence studies h-refinement p-refinement hp-adaptivity error estimators residual-based recovery-based goal-oriented dual-weighted residual functional output-based adaptivity anisotropic refinement stretching elements aligned dominant solution features boundary layer capturing shock capturing artificial viscosity entropy fix Roe flux vector splitting HLL HLLC Rusanov central schemes WENO weighted essentially non-oscillatory reconstruction ENO essentially non-oscillatory TVD total variation diminishing schemes limiters van Leer minmod superbee MCUMUSCL flux limiters slope limiters Barth-Jespersen node-centred cell-centred finite volume discretisation staggered collocated grid arrangements pressure-velocity coupling SIMPLE SIMPLER PISO pressure correction projection method Chorin artificial compressibility method characteristic-based split CBS fractional step method operator splitting Lie-Trotter Strang second-order splitting IMEX implicit-explicit schemes treating stiff terms implicitly non-stiff explicitly balance accuracy stability computational efficiency time step size selection adaptive controller PID feedback proportional-integral-derivative error norm monitoring refinement coarsening triggers coarsening criteria avoiding thrashing hysteresis band width selection parameter tuning sensitivity analysis global local Sobol indices Morris screening method elementary effects design of experiments fractional factorial full factorial central composite Box-Behnken response surface methodology RSM Kriging Gaussian process regression surrogate modelling metamodeling Bayesian optimisation acquisition function expected improvement probability of improvement upper confidence bound knowledge gradient entropy search max-value entropy search multi-armed bandit problem exploration-exploitation tradeoff epsilon-greedy softmax UCB Thompson sampling contextual bandits LinUCB neural bandits reinforcement learning Markov decision process MDP state action reward transition probability discount factor value function Bellman equation optimality equation policy iteration value iteration Q-learning SARSA actor-critic methods A2C A3C PPO SAC TD3 DDPG deterministic policy gradient trust region methods natural policy gradient advantage actor-critic GAE generalised advantage estimation eligibility traces lambda-return TD(λ) Monte Carlo methods TD(0) TD(λ) forward backward view equivalence batch incremental learning off-policy on-policy data collection importance sampling behaviour policy target policy ratio clipping PPO clipped surrogate objective dual KL constraint Lagrangian formulation trust region constraint region of trust defined by KL divergence between old new policy bounded delta hyperparameter tuning learning rate schedule cosine annealing warm restarts cyclic learning rates cyclical learning rates one-cycle policy super-convergence phenomenon observed empirically Smith 2018 training speedup factor reported two to three times compared constant learning rate baseline schedule on image classification tasks CIFAR-10 ImageNet ResNet architectures residual connections skip connections identity mapping reformulation enabling very deep networks hundred layers thousand layers training stability gradient flow analysis signal propagation theory initialisation schemes Xavier Glorot He uniform normal scaled variance inverse fan-in fan-out sum ReLU gain factor zero-centred non-zero-centred activations leaky ReLU parametric ReLU PReLU ELU SELU self-normalising property GELU Swish SiLU smooth approximation ReLU hard-tanh softsign softplus logarithmic ExU exponential unit product units gated linear units GLU gated convolutions GatedCNN WaveNet dilated causal convolutions temporal modelling audio waveforms spectrogram mel-frequency cepstral coefficients MFCC features mel filterbank log compression dynamic time warping DTW alignment sequence comparison edit distance Levenshtein distance Needleman-Wunsch global alignment Smith-Waterman local alignment sequence alignment bioinformatics applications multiple sequence alignment progressive alignment consistency consistency-based methods T-Coffee MAFFT MUSCLE ClustalW hidden Markov models HMM forward algorithm backward algorithm Viterbi algorithm Baum-Welch EM expectation maximisation parameter estimation profile HMMs HMMER package Pfam database protein family classification structural motif identification fold recognition threading ab initio structure prediction Rosetta fragment assembly I-TASSER threading-alignment-assembly-structure-refinement AlphaFold2 Evoformer structure module recycling recycling iterations IPA invariant point attention module geometric attention equivariance invariance properties SO(3) rotation group SE(3) rigid body transformations translation rotation screw theory Chasles theorem twist exponential coordinates rotation representation quaternion Euler angles axis-angle rotation matrix orthonormality determinant one special orthogonal group SO(3) special Euclidean group SE(3) Lie algebra so(3) se(3) exponential map logarithm map Jacobian adjoint representation adjoint action group representation theory character theory orthogonality relations Burnside’s lemma Frobenius reciprocity Mackey theory induced representations restriction functor induction functor tensor product representations Clebsch-Gordan coefficients Wigner d-functions spherical harmonics associated Legendre functions recurrence relations normalisation constants Condon-Shortley phase convention quantum mechanics angular momentum coupling addition theorem spherical harmonics Racah coefficients 6j symbols 9j symbols recoupling theory symmetry groups point groups crystallographic space groups 230 Shubnikov groups 32 crystal classes Laue classes 11 Laue classes lattice systems seven crystal systems cubic tetragonal orthorhombic hexagonal trigonal monoclinic triclinic Bravais lattices fourteen types centred lattices primitive body-centred face-centred base-centred side-centred all-face-centred reciprocal lattice Miller indices reciprocal lattice vectors diffraction conditions Bragg’s law Laue equations Ewald sphere construction structure factor atomic form factor Debye-Waller factor thermal displacement parameter temperature dependence anharmonic vibrations phonon dispersion relations acoustic optical branches zone centre zone boundary group velocity phase velocity density of states phonon density of states specific heat capacity Debye model Einstein model low-temperature T³ law high-temperature classical limit Dulong-Petit law equipartition theorem quantum statistics Bose-Einstein distribution Fermi-Dirac distribution Maxwell-Boltzmann distribution degenerate non-degenerate limits chemical potential fugacity activity coefficients ideal non-ideal solutions Raoult’s law Henry’s law deviations positive negative azeotropes distillation curves phase diagrams binary ternary multicomponent systems Gibbs phase rule degrees of freedom invariant univariant bivariant trivariant systems lever rule tie lines common tangent construction free energy minimisation convex hull construction tangent plane criterion stability conditions spinodal decomposition binodal curve metastable unstable regions nucleation classical nucleation theory CNT Becker-Döring theory kinetic Monte Carlo KMC molecular dynamics MD ensemble NVT NVE NPT NPAT NPγT NPμT NPμV grand canonical isobaric-isothermal semi-grand canonical hybrid Monte Carlo HMC replica exchange parallel tempering simulated tempering expanded ensemble Wang-Landau multicanonical methods density of states estimation flat histogram methods histogram reweighting free energy perturbation FEP thermodynamic integration TI free energy methods alchemical transformations decoupling coupling non-physical intermediate states lambda states soft-core potentials singularity avoidance scaling factors mass scaling constraints SHAKE RATTLE LINCS rigid body dynamics quaternions angular momentum conservation symplectic integrators velocity Verlet position Verlet leapfrog predictor-corrector methods Adams-Moulton BDF backward differentiation formulas stiff systems implicit solvers Krylov subspace methods GMRES BiCGSTAB QMR TFQMR FOM Arnoldi processes restart strategies GMRES(m) flexible variants FGMRES preconditioning strategies ILU incomplete LU ILUT ILUTP IC incomplete Cholesky AINV approximate inverse sparse approximate inverse SPAI domain decomposition methods additive Schwarz multiplicative Schwarz overlapping non-overlapping Schur complement methods FETI FETI-DP BDDC balancing domain decomposition constrained interface coarse grid correction two-level methods multi-level methods AMG algebraic multigraph coarsening Ruge-Stuben coarsening aggregation-based coarsening smoothed aggregation SA smoothed aggregation SA-AMG two-grid method cycle V W F K-cycle flexible variants adaptive AMG bootstrap AMG bootstrap aggregation BA-AMG energy minimization coarsening near-null space components near-null space vectors near-kernel vectors energy norm minimisation Rayleigh quotient Ritz value Ritz vector Galerkin coarse operator restriction prolongation operator smoothing weighted Jacobi damped Gauss-Seidel Chebyshev polynomial smoother acceleration techniques Krylov subspace methods Arnoldi Lanczos bidiagonalisation processes orthogonalisation Gram-Schmidt modified Gram-Schmidt reorthogonalisation strategies numerical stability Householder reflections Givens rotations QR decomposition least squares normal equations ill-conditioned systems Tikhonov regularisation ridge regression lasso elastic net sparsity inducing penalties variable selection model complexity control bias-variance tradeoff decomposition expected prediction error squared bias variance irreducible noise cross-validation k-fold leave-one-out bootstrap resampling bagging boosting stacking ensemble methods random subspace method feature bagging data perturbation techniques noise injection smoothing regularisation dropout stochastic depth mixup cutmix augmentation strategies image classification computer vision transfer learning fine-tuning pretraining self-supervised contrastive learning SimCLR MoCo BYOL DINO masked language modelling BERT GPT autoregressive transformer decoder-only encoder-decoder architectures T5 BART pointer-generator copy mechanism coverage mechanism attention alignment visualisation head inspection probing tasks linguistic competence evaluation GLUE SuperGLUE benchmarks leaderboard rankings Elo rating systems tournament pairings Swiss system double elimination single elimination round-robin scheduling constraint satisfaction optimisation bin packing knapsack travelling salesman vehicle routing job-shop scheduling facility location network flow max-flow min-cut linear programming simplex method interior point methods barrier penalty augmented Lagrangian KKT conditions complementary slackness duality theory strong weak dual problems primal dual relationship shadow prices economic interpretation marginal value resources constraint binding slack non-binding degeneracy cycling Bland rule lexicographic perturbation presolve techniques scaling equilibration presolve reductions eliminate redundant constraints variables tighten bounds fix variables implied constraints bound propagation constraint propagation arc consistency path consistency table consistency algorithms AC-3 AC-4 AC-6 maintaining consistency pruning search space backtracking forward checking maintaining arc consistency MAC dynamic variable ordering heuristics minimum remaining values MRV degree heuristic least constraining value choice value ordering tie-breaking rules random restarts iterated local search simulated annealing Metropolis criterion acceptance probability temperature schedule cooling geometric linear logarithmic adaptive temperature control based on acceptance rate feedback control maintaining target acceptance rate around twenty-three percent optimal theoretical setting continuous optimisation problems combinatorial settings tuning empirical practice genetic algorithms crossover mutation selection elitism population diversity maintenance niching fitness sharing crowding distance metric multi-objective optimisation Pareto optimality dominance relations non-dominated sorting NSGA-II SPEA2 MOEA/D decomposition scalarisation weighted sum Chebyshev achievement scalarising function ASF reference point methods interactive decision making preference articulation a posteriori a priori approaches hypervolume indicator generational distance inverted generational distance spread spacing metrics convergence diversity assessment evolutionary multi-objective algorithms applied engineering design topology optimisation shape optimisation structural mechanics finite element analysis mesh generation Delaunay triangulation advancing front methods quadtree octree adaptive refinement hanging node constraints conforming non-conforming discretisations compatibility patch test convergence studies h-refinement p-refinement hp-adaptivity error estimators residual-based recovery-based goal-oriented dual-weighted residual functional output-based adaptivity anisotropic refinement stretching elements aligned dominant solution features boundary layer capturing shock capturing artificial viscosity entropy fix Roe flux vector splitting HLL HLLC Rusanov central schemes WENO weighted essentially non-oscillatory reconstruction ENO essentially non-oscillatory TVD total variation diminishing schemes limiters van Leer minmod superbee MCUMUSCL flux limiters slope limiters Barth-Jespersen node-centred cell-centred finite volume discretisation staggered collocated grid arrangements pressure-velocity coupling SIMPLE SIMPLER PISO pressure correction projection method Chorin artificial compressibility method characteristic-based split CBS fractional step method operator splitting Lie-Trotter Strang second-order splitting IMEX implicit-explicit schemes treating stiff terms implicitly non-stiff explicitly balance accuracy stability computational efficiency time step size selection adaptive controller PID feedback proportional-integral-derivative error norm monitoring refinement coarsening triggers coarsening criteria avoiding thrashing hysteresis band width selection parameter tuning sensitivity analysis global local Sobol indices Morris screening method elementary effects design of experiments fractional factorial full factorial central composite Box-Behnken response surface methodology RSM Kriging Gaussian process regression surrogate modelling metamodeling Bayesian optimisation acquisition function expected improvement probability of improvement upper confidence bound knowledge gradient entropy search max-value entropy search multi-armed bandit problem exploration-exploitation tradeoff epsilon-greedy softmax UCB Thompson sampling contextual bandits LinUCB neural bandits reinforcement learning Markov decision process MDP state action reward transition probability discount factor value function Bellman equation optimality equation policy iteration value iteration Q-learning SARSA actor-critic methods A2C A3C PPO SAC TD3 DDPG deterministic policy gradient trust region methods natural policy gradient advantage actor-critic GAE generalised advantage estimation eligibility traces lambda-return TD(λ) Monte Carlo methods TD(0) TD(λ) forward backward view equivalence batch incremental learning off-policy on-policy data collection importance sampling behaviour policy target policy ratio clipping PPO clipped surrogate objective dual KL constraint Lagrangian formulation trust region constraint region of trust defined by KL divergence between old new policy bounded delta hyperparameter tuning learning rate schedule cosine annealing warm restarts cyclic learning rates cyclical learning rates one-cycle policy super-convergence phenomenon observed empirically Smith 2018 training speedup factor reported two to three times compared constant learning rate baseline schedule on image classification tasks CIFAR-10 ImageNet ResNet architectures residual connections skip connections identity mapping reformulation enabling very deep networks hundred layers thousand layers training stability gradient flow analysis signal propagation theory initialisation schemes Xavier Glorot He uniform normal scaled variance inverse fan-in fan-out sum ReLU gain factor zero-centred non-zero-centred activations leaky ReLU parametric ReLU PReLU ELU SELU self-normalising property GELU Swish SiLU smooth approximation ReLU hard-tanh softsign softplus logarithmic ExU exponential unit product units gated linear units GLU gated convolutions GatedCNN WaveNet dilated causal convolutions temporal modelling audio waveforms spectrogram mel-frequency cepstral coefficients MFCC features mel filterbank log compression dynamic time warping DTW alignment sequence comparison edit distance Levenshtein distance Needleman-Wunsch global alignment Smith-Waterman local alignment sequence alignment bioinformatics applications multiple sequence alignment progressive alignment consistency consistency-based methods T-Coffee MAFFT MUSCLE ClustalW hidden Markov models HMM forward algorithm backward algorithm Viterbi algorithm Baum-Welch EM expectation maximisation parameter estimation profile HMMs HMMER package Pfam database protein family classification structural motif identification fold recognition threading ab initio structure prediction Rosetta fragment assembly I-TASSER threading-alignment-assembly-structure-refinement AlphaFold2 Evoformer structure module recycling recycling iterations IPA invariant point attention module geometric attention equivariance invariance properties SO(3) rotation group SE(3) rigid body transformations translation rotation screw theory Chasles theorem twist exponential coordinates rotation representation quaternion Euler angles axis-angle rotation matrix orthonormality determinant one special orthogonal group SO(3) special Euclidean group SE(3) Lie algebra so(3) se(3) exponential map logarithm map Jacobian adjoint representation adjoint action group representation theory character theory orthogonality relations Burnside’s lemma Frobenius reciprocity Mackey theory induced representations restriction functor induction functor tensor product representations Clebsch-Gordan coefficients Wigner d-functions spherical harmonics associated Legendre functions recurrence relations normalisation constants Condon-Shortley phase convention quantum mechanics angular momentum coupling addition theorem spherical harmonics Racah coefficients 6j symbols 9j symbols recoupling theory symmetry groups point groups crystallographic space groups 230 Shubnikov groups 32 crystal classes Laue classes 11 Laue classes lattice systems seven crystal systems cubic tetragonal orthorhombic hexagonal trigonal monoclinic triclinic Bravais lattices fourteen types centred lattices primitive body-centred face-centred base-centred side-centred all-face-centred reciprocal lattice Miller indices reciprocal lattice vectors diffraction conditions Bragg’s law Laue equations Ewald sphere construction structure factor atomic form factor Debye-Waller factor thermal displacement parameter temperature dependence anharmonic vibrations phonon dispersion relations acoustic optical branches zone centre zone boundary group velocity phase velocity density of states phonon density of states specific heat capacity Debye model Einstein model low-temperature T³ law high-temperature classical limit Dulong-Petit law equipartition theorem quantum statistics Bose-Einstein distribution Fermi-Dirac distribution Maxwell-Boltzmann distribution degenerate non-degenerate limits chemical potential fugacity activity coefficients ideal non-ideal solutions Raoult’s law Henry’s law deviations positive negative azeotropes distillation curves phase diagrams binary ternary multicomponent systems Gibbs phase rule degrees of freedom invariant univariant bivariant trivariant systems lever rule tie lines common tangent construction free energy minimisation convex hull construction tangent plane criterion stability conditions spinodal decomposition binodal curve metastable unstable regions nucleation classical nucleation theory CNT Becker-Döring theory kinetic Monte Carlo KMC molecular dynamics MD ensemble NVT NVE NPT NPAT NPγT NPμT NPμV grand canonical isobaric-isothermal semi-grand canonical hybrid Monte Carlo HMC replica exchange parallel tempering simulated tempering expanded ensemble Wang-Landau multicanonical methods density of states estimation flat histogram methods histogram reweighting free energy perturbation FEP thermodynamic integration TI free energy methods alchemical transformations decoupling coupling non-physical intermediate states lambda states soft-core potentials singularity avoidance scaling factors mass scaling constraints SHAKE RATTLE LINCS rigid body dynamics quaternions angular momentum conservation symplectic integrators velocity Verlet position Verlet leapfrog predictor-corrector methods Adams-Moulton BDF backward differentiation formulas stiff systems implicit solvers Krylov subspace methods GMRES BiCGSTAB QMR TFQMR FOM Arnoldi processes restart strategies GMRES(m) flexible variants FGMRES preconditioning strategies ILU incomplete LU ILUT ILUTP IC incomplete Cholesky AINV approximate inverse sparse approximate inverse SPAI domain decomposition methods additive Schwarz multiplicative Schwarz overlapping non-overlapping Schur complement methods FETI FETI-DP BDDC balancing domain decomposition constrained interface coarse grid correction two-level methods multi-level methods AMG algebraic multigraph coarsening Ruge-Stuben coarsening aggregation-based coarsening smoothed aggregation SA smoothed aggregation SA-AMG two-grid method cycle V W F K-cycle flexible variants adaptive AMG bootstrap AMG bootstrap aggregation BA-AMG energy minimization coarsening near-null space components near-null space vectors near-kernel vectors energy norm minimisation Rayleigh quotient Ritz value Ritz vector Galerkin coarse operator restriction prolongation operator smoothing weighted Jacobi damped Gauss-Seidel Chebyshev polynomial smoother acceleration techniques Krylov subspace methods Arnoldi Lanczos bidiagonalisation processes orthogonalisation Gram-Schmidt modified Gram-Schmidt reorthogonalisation strategies numerical stability Householder reflections Givens rotations QR decomposition least squares normal equations ill-conditioned systems Tikhonov regularisation ridge regression lasso elastic net sparsity inducing penalties variable selection model complexity control bias-variance tradeoff decomposition expected prediction error squared bias variance irreducible noise cross-validation k-fold leave-one-out bootstrap resampling bagging boosting stacking ensemble methods random subspace method feature bagging data perturbation techniques noise injection smoothing regularisation dropout stochastic depth mixup cutmix augmentation strategies image classification computer vision transfer learning fine-tuning pretraining self-supervised contrastive learning SimCLR MoCo BYOL DINO masked language modelling BERT GPT autoregressive transformer decoder-only encoder-decoder architectures T5 BART pointer-generator copy mechanism coverage mechanism attention alignment visualisation head inspection probing tasks linguistic competence evaluation GLUE SuperGLUE benchmarks leaderboard rankings Elo rating systems tournament pairings Swiss system double elimination single elimination round-robin scheduling constraint satisfaction optimisation bin packing knapsack travelling salesman vehicle routing job-shop scheduling facility location network flow max-flow min-cut linear programming simplex method interior point methods barrier penalty augmented Lagrangian KKT conditions complementary slackness duality theory strong weak dual problems primal dual relationship shadow prices economic interpretation marginal value resources constraint binding slack non-binding degeneracy cycling Bland rule lexicographic perturbation presolve techniques scaling equilibration presolve reductions eliminate redundant constraints variables tighten bounds fix variables implied constraints bound propagation constraint propagation arc consistency path consistency table consistency algorithms AC-3 AC-4 AC-6 maintaining consistency pruning search space backtracking forward checking maintaining arc consistency MAC dynamic variable ordering heuristics minimum remaining values MRV degree heuristic least constraining value choice value ordering tie-breaking rules random restarts iterated local search simulated annealing Metropolis criterion acceptance probability temperature schedule cooling geometric linear logarithmic adaptive temperature control based on acceptance rate feedback control maintaining target acceptance rate around twenty-three percent optimal theoretical setting continuous optimisation problems combinatorial settings tuning empirical practice genetic algorithms crossover mutation selection elitism population diversity maintenance niching fitness sharing crowding distance metric multi-objective optimisation Pareto optimality dominance relations non-dominated sorting NSGA-II SPEA2 MOEA/D decomposition scalarisation weighted sum Chebyshev achievement scalarising function ASF reference point methods interactive decision making preference articulation a posteriori a priori approaches hypervolume indicator generational distance inverted generational distance spread spacing metrics convergence diversity assessment evolutionary multi-objective algorithms applied engineering design topology optimisation shape optimisation structural mechanics finite element analysis mesh generation Delaunay triangulation advancing front methods quadtree octree adaptive refinement hanging node constraints conforming non-conforming discretisations compatibility patch test convergence studies h-refinement p-refinement hp-adaptivity error estimators residual-based recovery-based goal-oriented dual-weighted residual functional output-based adaptivity anisotropic refinement stretching elements aligned dominant solution features boundary layer capturing shock capturing artificial viscosity entropy fix Roe flux vector splitting HLL HLLC Rusanov central schemes WENO weighted essentially non-oscillatory reconstruction ENO essentially non-oscillatory TVD total variation diminishing schemes limiters van Leer minmod superbee MCUMUSCL flux limiters slope limiters Barth-Jespersen node-centred cell-centred finite volume discretisation staggered collocated grid arrangements pressure-velocity coupling SIMPLE SIMPLER PISO pressure correction projection method Chorin artificial compressibility method characteristic-based split CBS fractional step method operator splitting Lie-Trotter Strang second-order splitting IMEX implicit-explicit schemes treating stiff terms implicitly non-stiff explicitly balance accuracy stability computational efficiency time step size selection adaptive controller PID feedback proportional-integral-derivative error norm monitoring refinement coarsening triggers coarsening criteria avoiding thrashing hysteresis band width selection parameter tuning sensitivity analysis global local Sobol indices Morris screening method elementary effects design of experiments fractional factorial full factorial central composite Box-Behnken response surface methodology RSM Kriging Gaussian process regression surrogate modelling metamodeling Bayesian optimisation acquisition function expected improvement probability of improvement upper confidence bound knowledge gradient entropy search max-value entropy search multi-armed bandit problem exploration-exploitation tradeoff epsilon-greedy softmax UCB Thompson sampling contextual bandits LinUCB neural bandits reinforcement learning Markov decision process MDP state action reward transition probability discount factor value function Bellman equation optimality equation policy iteration value iteration Q-learning SARSA actor-critic methods A2C A3C PPO SAC TD3 DDPG deterministic policy gradient trust region methods natural policy gradient advantage actor-critic GAE generalised advantage estimation eligibility traces lambda-return TD(λ) Monte Carlo methods TD(0) TD(λ) forward backward view equivalence batch incremental learning off-policy on-policy data collection importance sampling behaviour policy target policy ratio clipping PPO clipped surrogate objective dual KL constraint Lagrangian formulation trust region constraint region of trust defined by KL divergence between old new policy bounded delta hyperparameter tuning learning rate schedule cosine annealing warm restarts cyclic learning rates cyclical learning rates one-cycle policy super-convergence phenomenon observed empirically Smith 2018 training speedup factor reported two to three times compared constant learning rate baseline schedule on image classification tasks CIFAR-10 ImageNet ResNet architectures residual connections skip connections identity mapping reformulation enabling very deep networks hundred layers thousand layers training stability gradient flow analysis signal propagation theory initialisation schemes Xavier Glorot He uniform normal scaled variance inverse fan-in fan-out sum ReLU gain factor zero-centred non-zero-centred activations leaky ReLU parametric ReLU PReLU ELU SELU self-normalising property GELU Swish SiLU smooth approximation ReLU hard-tanh softsign softplus logarithmic ExU exponential unit product units gated linear units GLU gated convolutions GatedCNN WaveNet dilated causal convolutions temporal modelling audio waveforms spectrogram mel-frequency cepstral coefficients MFCC features mel filterbank log compression dynamic time warping DTW alignment sequence comparison edit distance Levenshtein distance Needleman-Wunsch global alignment Smith-Waterman local alignment sequence alignment bioinformatics applications multiple sequence alignment progressive alignment consistency consistency-based methods T-Coffee MAFFT MUSCLE ClustalW hidden Markov models HMM forward algorithm backward algorithm Viterbi algorithm Baum-Welch EM expectation maximisation parameter estimation profile HMMs HMMER package Pfam database protein family classification structural motif identification fold recognition threading ab initio structure prediction Rosetta fragment assembly I-TASSER threading-alignment-assembly-structure-refinement AlphaFold2 Evoformer structure module recycling recycling iterations IPA invariant point attention module geometric attention equivariance invariance properties SO(3) rotation group SE(3) rigid body transformations translation rotation screw theory Chasles theorem twist exponential coordinates rotation representation quaternion Euler angles axis-angle rotation matrix or |
