Where does relaxation collide?

The gradual return of a disturbed physical system to equilibrium, and the characteristic time that return takes. James Clerk Maxwell's 1867 On the dynamical theory of gases introduced a time of relaxation for the decay of shear stress in a gas, the interval over which an imposed stress dies away as molecules collide. Felix Bloch's 1946 Nuclear induction later carried the same idea into magnetic resonance, describing how a perturbed nuclear magnetization relaxes back toward its rest value along two timescales. Here the referent is a measurable physical decay in a material or field, timed in seconds or shorter, not a person calming down or a mathematical problem being loosened.[1][2]

Unit

One decay process, scaled by its relaxation time (how fast the system returns)

Recovery means

The system itself recovers: the disturbed quantity decays back to its equilibrium value

Measured by

Fitted from the decay curve of the perturbed quantity, giving one or more relaxation times

A trained, deliberate reduction of muscular tension and physiological arousal in a person. Edmund Jacobson's 1925 Progressive relaxation taught people to detect and release residual tension muscle group by muscle group, arguing that deep muscular quiet lowers nervous excitability. Herbert Benson, Beary, and Carol's 1974 The relaxation response generalized this into a repeatable low-arousal state, marked by slower breathing, lower heart rate, and reduced oxygen use, that simple mental techniques can bring on. Here the referent is a bodily and mental state a person can practice and produce, not the spontaneous decay of stress in a material or the loosening of a mathematical model.[3][4]

Unit

One episode or trained state of lowered tension and arousal in a person

Recovery means

Not applicable

Measured by

Indexed by muscle tension (EMG), heart rate, breathing rate, and self-reported calm

A modified optimization problem in which some of the original requirements are dropped or loosened, so the set of allowed solutions grows and its best value bounds the harder original. Held and Karp's 1970 The traveling-salesman problem and minimum spanning trees used such a relaxation, replacing part of the tour requirement with a cheaper spanning-tree structure to bound the true shortest route. Arthur Geoffrion's 1974 Lagrangean relaxation for integer programming formalized the family, moving awkward constraints into the objective with a penalty so the remaining problem is easy to solve and still yields a bound. Here the referent is a deliberately weakened mathematical model used to bound or approximate a hard one, not a physical decay or a state of bodily calm.[5][6]

Unit

One relaxed problem paired with its original, judged by the bound it gives

Recovery means

Not applicable

Measured by

Assessed by the tightness of its bound and the gap to the true optimum