GBEPFIT(1)

📦 version 6.3, in debian bookworm, debian trixie, ubuntu jammy, ubuntu noble, ubuntu questing, ubuntu resolute, ubuntu stonking

✨ GBEPFIT ✨

okay so bestie, welcome to GBEPFIT(1) — that's section 1 of the User Commands manual, i.e. the "you type this in a terminal" zone. Sit down, hydrate, we're fitting a density 💅

🌸 NAME 🌸

gbepfit — fit a symmetric power exponential density. that's it, that's the whole name, and she's iconic

🦋 SYNOPSIS 🦋

gbepfit [options]

💖 DESCRIPTION 💖

So what she does: gbepfit fits a symmetric power exponential density, and you get to pick your whole method — either maximum-likelihood or the method of moments. Pick your fighter, both are valid 🫶

👑 OPTIONS 👑

  • -O — output type (default 0). The vibe check on what you actually get back:
    • 0 — parameter b a m and log-likelihood
    • 1 — the estimated distribution function computed on the provided points
    • 2 — the estimated density function computed on the provided points
    • 3 — parameters b a m and their standard errors
  • -x — set initial conditions b,a,m (default 2,1,0). this is literally where she starts her little journey 🧚
  • -m — the mode is not estimated but is set to the value provided. you're locking her in, no negotiation ✋
  • -s — number of intervals to explore at each iteration (default 10)
  • -V — verbosity level (default 0). how much she talks to you:
    • 0 — just the final result
    • 1 — headings and summary table
    • 2 — intermediate steps results
    • 3 — intermediate steps internals
    • 4+ — details of optim. routine
  • -M — active estimation steps. The value is the sum of (default 7). yes bestie, it's additive, you add them up:
    • 1 — initial estimation based on method of moments
    • 2 — global optimization not considering lack of smoothness in m
    • 4 — local optimization taking non-smoothness in m into consideration
  • -G — set global optimization options. Fields are step,tol,iter,eps,msize,algo. Empty field implies default (default .1,1e-2,100,1e-3,1e-5,3)
  • -I — set local optimization options. Fields are step,tol,iter,eps,msize,algo. Empty field implies default (default .01,1e-4,200,1e-4,1e-5,5)
  • -F — input fields separators (default " \t")
  • -h — this help. hi 👋

🌈 the optimization parameters, explained 🌈

  • step — initial step size of the searching algorithm
  • tol — line search tolerance iter: maximum number of iterations
  • eps — gradient tolerance : stopping criteria ||gradient||<eps
  • msize — simplex max size : stopping criteria ||max edge||<msize
  • algo — optimization methods: 0 Fletcher-Reeves, 1 Polak-Ribiere, 2 Broyden-Fletcher-Goldfarb-Shanno, 3 Steepest descent, 4 Nelder-Mead simplex, 5 Broyden-Fletcher-Goldfarb-Shanno v.2, 6 Nelder-Mead simplex ver. 2, 7 Nelder-Mead simplex rnd init.

🍓 EXAMPLES 🍓

gbepfit -m 1 -M 6 <file

what this does: estimate a and b with m=1 and skipping initial method of moments estimation. she ate, no cap 🔥

💜 AUTHOR 💜

Written by Giulio Bottazzi. king behavior 👑

🙈 REPORTING BUGS 🙈

Found a bug? not the vibe. Report bugs to <gbutils@googlegroups.com>

Package home page <http://cafim.sssup.it/~giulio/software/gbutils/index.html>

Copyright © 2001-2018 Giulio Bottazzi This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License (version 2) as published by the Free Software Foundation;

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

okay real talk for one sec 💀 — that "WITHOUT ANY WARRANTY" bit is not a joke and not decoration, it means exactly what it says, so don't come for her if it doesn't do the thing.

and that's the whole page, bestie ✨ this one's gbepfit version 6.0.beta2, dated February 2019 — so if you're reading this in the future, yes, she's an elder but she still serves. mwah 💋

📦 where this page comes from