maasencioh

#!/bin/sh

REPO=resuelve/$1
TOKEN=$2

labels=(
  '{"name": "Bug 🐛", "description": "MUCHO ROJO!!!", "color": "d73a4a"}'
  '{"name": "Documentación 📗", "description": "Documentación", "color": "a369ef"}'
  '{"name": "Epic", "description": "Épica", "color": "3E4B9E"}'
  '{"name": "Hackday 💡", "description": "Puntos extras por mejora muy opcional", "color": "5319e7"}'

maasencioh

/*
 * levmarq.c
 *
 * This file contains an implementation of the Levenberg-Marquardt algorithm
 * for solving least-squares problems, together with some supporting routines
 * for Cholesky decomposition and inversion.  No attempt has been made at
 * optimization.  In particular, memory use in the matrix routines could be
 * cut in half with a little effort (and some loss of clarity).
 *
 * It is assumed that the compiler supports variable-length arrays as